67 search results - page 1 / 14 » Local Verification of Global Invariants in Concurrent Progra... |
CAV
2010
Springer
13 years 10 months ago
2010
Springer
We describe a practical method for reasoning about realistic concurrent programs. Our method allows global two-state invariants that restrict update of shared state. We provide sim...
HYBRID
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. In this paper we propose a trajectory based reachability analysis by using local finite-time invariance property. Trajectory based analysis are based on the execution tra...
ICFP
2004
ACM
14 years 6 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...
KBSE
1999
IEEE
13 years 11 months ago
1999
IEEE
Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysi...
ECOOP
2008
Springer
13 years 8 months ago
2008
Springer
Shared mutable objects pose grave challenges in reasoning, especially for data abstraction and modularity. This paper presents a novel logic for erroravoiding partial correctness o...