Applications of Craig interpolants in model checking

Lecture Notes in Computer Science

Volumn 3440, Issue , 2005, Pages 1-12

  McMillan, K L ^a  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE AUTOMATA; MATHEMATICAL MODELS; SOFTWARE ENGINEERING;

CRAIG INTERPOLANTS; MODEL CHECKING;

INTERPOLATION;

EID: 24644519059     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31980-1_1     Document Type: Conference Paper

References (18)

1. T. Ball, A. Podelski, and S. K. Rajamani. Boolean and Cartesian abstraction for model checking C programs. STTT, 5(1):49-58, 2003.
2. Armin Biere, Alessandro Cimatti, Edmund Clarke, and Yunshan Zhu. Symbolic model checking without BDDs. In TACAS'99, volume 1579 of LNCS, pages 193-207, 1999.
3. J. R. Burch, E. M. Clarke, and D. E. Long. Symbolic model checking with partitioned transition relations. In VLSI '91, Edinburgh, Scotland, 1991.
4. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In Computer Aided Verification, pages 154-169, 2000.
5. W. Craig. Three uses of the her brand-gentzen theorem in relating model theory and proof theory. J. Symbolic Logic, 22(3):269-285, 1957.
6. Satyaki Das and David L. Dill. Successive approximation of abstract transition relations. In LICS 2001, pages 51-60, 2001.
7. T. A. Henzinger, R. Jhala, Rupak Majumdar, and K. L. McMillan. Abstractions from proofs. In Principles of Prog. Lang. (POPL 2004), 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 and R. E. Bryant. Constructing quantified invariants via predicate abstraction. In Verification, Model Checking, and Abstract Interpretation (VMCAI 2004), volume 2937 of LNCS, pages 267-281. Springer, 2004.
10. K. L. McMillan. An interpolating prover. Theoretical Computer Science. To appear.
11. K. L. McMillan. Applying sat methods in unbounded symbolic model checking. In Computer-Aided Verification (CAV 2002), pages 250-264, 2002.
12. K. L. McMillan and N. Amla. Automatic abstraction without counterexamples. In Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2003), pages 2-17, 2003.
13. 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.
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. Hassen Saïdi and Susanne Graf. Construction of abstract state graphs with PVS. In Orna Grumberg, editor, Computer-Aided Verification, CAV '97, volume 1254, pages 72-83, Haifa, Israel, 1997. Springer-Verlag.
16. M. Sheeran, S. Singh, and G. Stalmarck. Checking safety properties using induction and a SAT-solver. In Formal Methods in Computer Aided Design, 2000.
17. J. P. M. Silva and K. A. Sakallah. GRASP-a new search algorithm for satisfiability. In Proceedings of the International Conference on Computer-Aided Design, November 1996, 1996.
18. R. Majumdar T. A. Henzinger, R. Jhala and G. Sutre. Lazy abstraction. In Principles of Programming Languages (POPL 2002), 2002.