A practical and complete approach to predicate refinement

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3920 LNCS, Issue , 2006, Pages 459-473

  Jhala, Ranjit ^a   McMillan, K L ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ARTIFICIAL INTELLIGENCE; COMPUTER SOFTWARE; MATHEMATICAL MODELS;

CURRENT HEURISTICS; SOFTWARE MODEL;

BOOLEAN ALGEBRA;

EID: 33745777418     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11691372_33     Document Type: Conference Paper

References (15)

1. T. Ball, A. Podelski, and S. K. Rajamani. Relative completeness of abstraction refinement for software model checking. In TACAS, pages 158-172, 2002.
2. T. Ball and S. K. Rajamani. Generating abstract explanations of spurious counterexamples in c programs. Technical Report MSR-TR-2002-09, Microsoft, 2002.
3. S. Chaki, E. M. Clarke, A. Groce, and O. Strichman. Predicate abstraction with minimum predicates. In CHARME, pages 19-34, 2003.
4. E. Clarke, D. Kroening, N. Sharygina, and K. Yorav. Predicate abstraction of ANSI-C programs using SAT. Formal Methods in System Design (FMSD), 25:105-127, September-November 2004.
5. W. Craig. Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory. J. Symbolic Logic, 22(3):269-285, 1957.
6. L. de Moura, H. Rueß, and M. Sorea. Lazy theorem proving for bounded model checking over infinite domains. In CADE, pages 438-455, 2002.
7. T. A. Henzinger, R. Jhala, R. Majumdar, and K. L. McMillan. Abstractions from proofs. In POPL, pages 232-244, 2004.
8. Y. Lakhnech, S. Bensalem, S. Berezin, and S. Owre. Incremental verification by abstraction. In TACAS, pages 98-112, 2001.
9. S. McIlraith and E. Amir. Theorem proving in structured theories (full report). Technical Report KSL-01-04, Stanford, 2001.
10. K. L. McMillan. Interpolation and sat-based model checking. In CAV, pages 1-13, 2003.
11. K. L. McMillan. An interpolating theorem prover. In TACAS, pages 16-30, 2004.
12. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Design Automation Conference, pages 530-535, 2001.
13. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Trans. on Prog. Lang. and Sys., 1(2):245-257, 1979.
14. H. Saïdi and S. Graf. Construction of abstract state graphs with PVS. In CAV, pages 72-83, 1997.
15. R. Majumdar T. A. Henzinger, R. Jhala and G. Sutre. Lazy abstraction. In POPL, pages 58-70, 2002.