A combination method for generating interpolants

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

Volumn 3632 LNAI, Issue , 2005, Pages 353-368

  Yorsh, Greta ^a   Musuvathi, Madanlal ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION THEORY; FUNCTIONS; LISP (PROGRAMMING LANGUAGE);

FIRST-ORDER THEORIES; LINEAR INEQUALITIES; NELSON-OPPEN THEORIES;

INTERPOLATION;

EID: 26944486643     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11532231_26     Document Type: Conference Paper

References (19)

1. C. Barrett and S. Berezin. CVC Lite: A new implementation of the cooperating validity checker. In CAV, pages 515-518, 2004.
2. W. Craig. Linear reasoning, a new form of the herbrand-gentzen theorem. J. Symbolic Logic, 22:250-268, 1957.
3. D. Detlefs, G. Nelson, and J. Saxe. Simplify theorem prover. http://research.compaq.com/SRC/esc/Simplify.html.
4. J.-C. Filliâtre, S. Owre, H. Rueß, and N. Shankar. ICS: integrated canonizer and solver. In CAV, pages 246-249, 2001.
5. C. Flanagan, R. Joshi, X. Ou, and J. B. Saxe. Theorem proving using lazy proof explication. In CAV, pages 355-367, 2003.
6. J. H. Gallier. Logic for Computer Science: Foundations of Automatic Theorem Proving. John Wiley & Sons, New York, 1987.
7. V. Ganesh, S. Berezin, C. Tinelli, and D. L. Dill. Combination results for manysorted theories with overlapping signatures. Technical report, Department of Computer Science, Stanford University, 2004.
8. P. Gerhardy. Refined Complexity Analysis of Cut Elimination. In CSL, pages 212-225, 2003.
9. G.Takeuti. Studies in Logic, volume 81. Elsevier, Amsterdam, North Holland, 1975.
10. Sumit Gulwani and Ashish Tiwari. Unpublished manuscript.
11. T. A. Henzinger, R. Jhala, R. Majumdar, and K. L. McMillan. Abstractions from proofs. In POPL, pages 232-244, 2004.
12. K.L. McMillan. Interpolation and sat-based model checking. In CAV, pages 1-13, 2003.
13. K.L. McMillan. An interpolating theorem prover. In TACAS, pages 16-30, 2004.
14. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems, 1(2):245-257, October 1979.
15. G. Nelson and D. C. Oppen. Fast decision procedures based on congruence closure. J. ACM, 27(2):356-364, 1980.
16. Derek C. Oppen. Complexity, convexity and combinations of theories. In Theoretical Computer Science, volume 12, pages 291-302, 1980.
17. P. Pudlák. Lower bounds for resolution and cutting planes proofs and monotone computations. J. of Symbolic Logic, 62(3):981-998, 1995.
18. S.C.Kleene. Mathematical Logic. Wiley Interscience, New York, 1967.
19. G. Yorsh and M. Musuvathi. A combination method for generating interpolants. Technical Report MSR-TR-2004-108, Microsoft Research, October 2004.