108 search results - page 4 / 22 » Verification of Concurrent Programs with Chalice |
FAC
2007
13 years 7 months ago
2007
CAV
2009
Springer
14 years 8 months ago
2009
Springer
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
AICOM
2010
13 years 7 months ago
2010
This paper presents an interactive proof method for the verification of temporal properties of concurrent systems based on symbolic execution. Symbolic execution is a well known a...
ICFP
2004
ACM
14 years 7 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly l...