Sciweavers

156 search results - page 5 / 32
» Automatic Inference of Class Invariants
Sort
View
APLAS
2009
ACM
14 years 2 months ago
Bi-abductive Resource Invariant Synthesis
We describe an algorithm for synthesizing resource invariants that are used in the verification of concurrent programs. This synthesis employs bi-abductive inference to identify t...
Cristiano Calcagno, Dino Distefano, Viktor Vafeiad...
FMCAD
2008
Springer
13 years 9 months ago
Automatic Non-Interference Lemmas for Parameterized Model Checking
Parameterized model checking refers to any method that extends traditional, finite-state model checking to handle systems arbitrary number of processes. One popular approach to thi...
Jesse D. Bingham
VMCAI
2009
Springer
14 years 2 months ago
Thread-Modular Shape Analysis
We present the first shape analysis for multithreaded programs that avoids the explicit enumeration of execution-interleavings. Our approach is to automatically infer a resource ...
Alexey Gotsman, Josh Berdine, Byron Cook, Mooly Sa...
POPL
2002
ACM
14 years 8 months ago
Predicate abstraction for software verification
e Abstraction for Software Verification Cormac Flanagan Shaz Qadeer Compaq Systems Research Center 130 Lytton Ave, Palo Alto, CA 94301 Software verification is an important and di...
Cormac Flanagan, Shaz Qadeer
APLAS
2005
ACM
13 years 9 months ago
Loop Invariants on Demand
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...
K. Rustan M. Leino, Francesco Logozzo