Interpolant-based transition relation approximation

Lecture Notes in Computer Science

Volumn 3576, Issue , 2005, Pages 39-51

  Jhala, Ranjit ^a   McMillan, K L ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTER SOFTWARE; DECISION MAKING; INTERPOLATION; SET THEORY;

DECISION PROCEDURES; SOFTWARE MODEL CHECKERS;

PROBLEM SOLVING;

EID: 26444541620     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11513988_6     Document Type: Conference Paper

References (16)

1. http://www-cad.eecs.berkeley.edu/~kenmcmil/papers/cav05full.pdf.
2. Thomas Ball and Sriram K. Rajamani. The SLAM project: debugging system software via static analysis. In POPL, pages 1-3, 2002.
3. A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In TACAS, pages 193-207, 1999.
4. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In CAV, pages 154-169, 2000.
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. S. Das and D. L. Dill. Successive approximation of abstract transition relations. In LICS, pages 51-60, 2001.
7. T. A. Henzinger, R. Jhala, R. Majumdar, and K. L. McMillan. Abstractions from proofs. In POPL, pages 232-244, 2004.
8. J. Krajíček. Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic. J. Symbolic Logic, 62(2):457-486, June 1997.
9. S. K. Lahiri, R. E. Bryant, and B. Cook. A symbolic approach to predicate abstraction. In CAV, pages 141-153, 2003.
10. K. L. McMillan. Interpolation and sat-based model checking. In CAV, pages 1-13, 2003.
11. K. L. McMillan. An interpolating prover. Theoretical Computer Science, 2005. To appear.
12. K. L. McMillan and N. Amla. Automatic abstraction without counterexamples. In TACAS, pages 2-17, 2003.
13. P. Pudlák. Lower bounds for resolution and cutting plane proofs and monotone computations. J. Symbolic Logic, 62(2):981-998, June 1997.
14. A. Rubini and J. Corbet. Linux Device Drivers. O'Reilly, 2001.
15. H. Saïdi and S. Graf. Construction of abstract state graphs with PVS. In CAV, pages 72-83, 1997.
16. R. Majumdar T. A. Henzinger, R. Jhala and G. Sutre. Lazy abstraction. In POPL, pages 58-70, 2002.