29 search results - page 1 / 6 » A Theory for Abstract Reduction Systems in PVS |
CLEIEJ
2008
13 years 5 months ago
2008
FUIN
2006
13 years 5 months ago
2006
Abstract. This paper describes an attempt to combine theorem proving and model-checking to formally verify real-time systems in a discrete time setting. The Timed Automata Modeling...
AMAST
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. State space explosion is the hardest challenge to the effective application of model checking methods. We present a new technique for achieving drastic state space reduct...
WOLLIC
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. The intruder deduction problem for an electronic purse protocol with blind signatures is considered. The algebraic properties of the protocol are modeled by an equational...
TPHOL
2008
IEEE
13 years 12 months ago
2008
IEEE
g to the well-known “LCF approach” of secure inferences as abstract datatype constructors in ML [16]; explicit proof terms are also available [8]. Isabelle/Isar provides sophis...