An Interpolating Theorem Prover

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

Volumn 2988, Issue , 2004, Pages 16-30

  McMillan, K L ^a  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FEEDBACK; INTERPOLATION; MODEL CHECKING; STATE FEEDBACK;

CRAIG INTERPOLANTS; INFINITE STATE SYSTEMS; LINEAR INEQUALITIES; SOFTWARE MODEL CHECKERS; THEOREM PROVERS; UNINTERPRETED FUNCTION SYMBOLS;

THEOREM PROVING;

EID: 35048822487     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24730-2_2     Document Type: Article

References (14)

1. W. Craig. Linear reasoning: A new form of the Herbrand-Gentzen theorem. J. Symbolic Logic, 22(3):250-268, 1957.
2. Leonardo de Moura, Harald Rueß, and Maria Sorea. Lazy theorem proving for bounded model checking over infinite domains. In 18th Conference on Automated Deduction (CADE), Lecture Notes in Computer Science, Copenhagen, Denmark, July 27-30 2002. Springer Verlag.
3. T. A. Henzinger, R. Jhala, Rupak Majumdar, and K. L. McMillan. Abstractions from proofs. In ACM Symp. on Principles of Prog. Lang. (POPL 2004), 2004. to appear.
4. 20 States and Beyond. In Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, pages 1-33, Washington, D.C., 1990. IEEE Computer Society Press.
5. 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.
6. S. K. Lahiri, R. E. Bryant, and B. Cook. A symbolic approach to predicate abstraction. In Computer-Aided Verification (CAV 2003), pages 141-153, 2003.
7. K. L. McMillan. Interpolation and sat-based model checking. In Computer-Aided Verification (CAV 2003), pages 1-13, 2003.
8. K. L. McMillan and Nina Amla. Automatic abstraction without counterexamples. To appear, TACAS'03.
9. M. W. Moskewicz, C. F. Madigan, Y. Z., L. Z., and S. Malik. Chaff: Engineering an efficient SAT solver. In Design Automation Conference, pages 530-535, 2001.
10. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Trans, on Prog. Lang, and Sys., 1(2):245-257, 1979.
11. D. Plaisted and S. Greenbaum. A structure preserving clause form translation. Journal of Symbolic Computation, 2:293-304, 1986.
12. P. Pudlák. Lower bounds for resolution and cutting plane proofs and monotone computations. J. Symbolic Logic, 62(2):981-998, June 1997.
13. 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.
14. 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.