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...
Ernie Cohen, Michal Moskal, Wolfram Schulte, Steph...
This paper describes a sound technique that combines the precision em proving with the loop-invariant inference of abstract interpretation. The loop-invariant computations are invo...
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...
Anindya Banerjee, David A. Naumann, Stan Rosenberg
Despite extensive testing in the development phase, residual defects can be a great threat to dependability in the operational phase. This paper studies the utility of lowcost, ge...
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...