An interpolating theorem prover

Theoretical Computer Science

Volumn 345, Issue 1, 2005, Pages 101-121

  McMillan, K L ^a  

^a CADENCE DESIGN SYSTEMS   (United States)

Author keywords

Craig interpolation; Decision procedures; Infinite state systems; Model checking

Indexed keywords

APPROXIMATION THEORY; COMPUTER SCIENCE; COMPUTER SOFTWARE; DECISION THEORY; INFORMATION TECHNOLOGY; MATHEMATICAL MODELS; THEOREM PROVING;

CRAIG INTERPOLATION; DECISION PROCEDURES; INFINITE-STATE SYSTEMS; MODEL CHECKING;

INTERPOLATION;

EID: 27644576055     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.07.003     Document Type: Conference Paper

References (14)

1. 20 states and beyond Proc. Fifth Annu. IEEE Symp. on Logic in Computer Science 1990 IEEE Computer Society Press Washington, DC 1 33
2. W. Craig Three uses of the herbrand-gentzen theorem in relating model theory and proof theory J. Symbolic Logic 22 3 1957 269 285
3. L. de Moura, H. Rueß, M. Sorea, Lazy theorem proving for bounded model checking over infinite domains, in: 18th Conf. on Automated Deduction, CADE 2002, Lecture Notes in Computer Science, Springer, Copenhagen, Denmark, July 27-30, 2002.
4. T.A. Henzinger, R. Jhala, R. Majumdar, K.L. McMillan, Abstractions from proofs, in: ACM Symp. on Principles of Programming Language, POPL 2004, 2004, pp. 232-244.
5. J. Krajíček Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic J. Symbolic Logic 62 2 1997 457 486
6. S.K. Lahiri, R.E. Bryant, B. Cook, A symbolic approach to predicate abstraction, in: Computer-Aided Verification, CAV 2003, 2003, pp. 141-153.
7. K.L. McMillan, Interpolation and sat-based model checking, in: Computer-Aided Verification, CAV 2003, 2003, pp. 1-13.
8. K.L. McMillan, N. Amla, Automatic abstraction without counterexamples, in: Internat. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2003, 2003, pp. 2-17.
9. M.W. Moskewicz, C.F. Madigan, Y. Zhao, L. Zhang, S. Malik, Chaff: engineering an efficient SAT solver, in: Design Automation Conference, 2001, pp. 530-535.
10. G. Nelson, and D.C. Oppen Simplification by cooperating decision procedures ACM Trans. Progr. Language Systems 1 2 1979 245 257
11. D. Plaisted, and S. Greenbaum A structure preserving clause form translation J. Symbolic Comput. 2 1986 293 304
12. P. Pudlák Lower bounds for resolution and cutting plane proofs and monotone computations J. Symbolic Logic 62 2 1997 981 998
13. H. Saïdi, and S. Graf Construction of abstract state graphs with PVS O. Grumberg Computer-Aided Verification, CAV '97 Vol. 1254 1997 Springer Haifa, Israel 72 83
14. J.P.M. Silva, K.A. Sakallah, GRASP - a new search algorithm for satisfiability, in: Proc. Internat. Conf. on Computer-Aided Design, November 1996.