54 search results - page 5 / 11 » Incompleteness of states w.r.t. traces in model checking |
ICALP
2001
Springer
15 years 4 months ago
2001
Springer
A cryptographic protocol can be described as a system of concurrent processes, and analysis of the traces generated by this system can be used to verify authentication and secrecy ...
IPPS
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper investigates a complexity-effective technique for verifying a highly distributed directory-based cache coherence protocol. We develop a novel approach called “witnes...
112
click to vote
ATVA
2007
Springer
15 years 6 months ago
2007
Springer
This paper presents a bounded model checking algorithm for the verification of analog and mixed-signal (AMS) circuits using a satisfiability modulo theories (SMT) solver. The sys...
125
click to vote
CONCUR
2006
Springer
15 years 1 months ago
2006
Springer
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
SIGSOFT
2007
ACM
16 years 15 days ago
2007
ACM
The systematic exploration of the space of all the behaviours of a software system forms the basis of numerous approaches to verification. However, existing approaches face many c...