Interpolant-based transition relation approximation

Logical Methods in Computer Science

Volumn 3, Issue 4, 2007, Pages

  Jhala, Ranjit ^a   McMillan, Kenneth L ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b CADENCE DESIGN SYSTEMS   (United States)

Author keywords

Predicate abstraction interpolation; Software model checking

Indexed keywords

ABSTRACTING; INTERPOLATION;

COUNTEREXAMPLE ANALYSIS; DECISION PROCEDURE; EXPONENTIAL NUMBERS; PREDICATE ABSTRACTIONS; SOFTWARE MODEL CHECKERS; SOFTWARE MODEL CHECKING; TRANSITION RELATIONS; WEAK APPROXIMATION;

MODEL CHECKING;

EID: 84966689453     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-3(4:1)2007     Document Type: Article

References (15)

1. A. Biere, A. Cimatti, E.M. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In TACAS 99: Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science 1579, pages 193-207. Springer, 1999.
2. T. Ball and S.K. Rajamani. The SLAM project: debugging system software via static analysis. In POPL 02: Principles of Programming Languages, pages 1-3. ACM, 2002.
3. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In CAV 00: Computer-Aided Verification, Lecture Notes in Computer Science 1855, pages 154-169. Springer, 2000.
4. W. Craig. Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory. J. Symbolic Logic, 22(3):269-285, 1957.
5. S. Das and D.L. Dill. Successive approximation of abstract transition relations. In LICS 01: Logic in Computer Science, pages 51-60. IEEE Press, 2001.
6. S. Graf and H. Saïdi. Construction of abstract state graphs with PVS. In CAV 97: Computer Aided Verification, LNCS 1254, pages 72-83. Springer, 1997.
7. T.A. Henzinger, R. Jhala, R. Majumdar, and K.L. McMillan. Abstractions from proofs. In POPL 04: Principles of Programming Languages, pages 232-244. ACM, 2004.
8. T.A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In POPL 02: Principles of Programming Languages, pages 58-70. ACM, 2002.
9. 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.
10. S. K. Lahiri, R. E. Bryant, and B. Cook. A symbolic approach to predicate abstraction. In CAV 03: Computer-Aided Verification, Lecture Notes in Computer Science 2725, pages 141-153. Springer, 2003.
11. K. L. McMillan and N. Amla. Automatic abstraction without counterexamples. In TACAS 03: Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science 2619, pages 2-17. Springer, 2003.
12. K.L. McMillan. Interpolation and SAT-based model checking. In CAV 03: Computer-aided Verification, Lecture Notes in Computer Science 2725, pages 1-13. Springer, 2003.
13. Kenneth L. McMillan. An interpolating theorem prover. Theor. Comput. Sci., 345(1):101-121, 2005.
14. P. Pudlák. Lower bounds for resolution and cutting plane proofs and monotone computations. J. Symbolic Logic, 62(2):981-998, June 1997.
15. A. Rubini and J. Corbet. Linux Device Drivers. O’Reilly, 2001.