Combined satisfiability modulo parametric theories

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

Volumn 4424 LNCS, Issue , 2007, Pages 602-617

  Krstić, Sava ^a   Goel, Amit ^a   Grundy, Jim ^a   Tinelli, Cesare ^b  

^a INTEL CORPORATION   (United States)

^b University of Iowa   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; DECISION THEORY; THEOREM PROVING; VERIFICATION; COMPUTERS;

DECISION PROCEDURES; SATISFIABILITY MODULO PARAMETRIC THEORIES; COMMON DATUM; DECISION PROCEDURE; SATISFIABILITY; SMT SOLVERS; THEORETICAL FOUNDATIONS;

STATISTICAL METHODS; ARTIFICIAL INTELLIGENCE;

EID: 37148998564     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71209-1_47     Document Type: Conference Paper

References (24)

1. N. Ayache and J.-C. Filliâtre. Combining the Coq proof assistant with first-order decision procedures, (unpublished), 2006.
2. C. Barrett and S. Berezin. CVC Lite: A new implementation of the cooperating validity checker. In Computer Aided Verification (CAV), vol. 3114 of LNCS, pp. 515-518. 2004.
3. C. Barrett, I. Shikanian, and C. Tinelli. An abstract decision procedure for satisfiability in the theory of recursive data types. In Pragmatics of Decision Procedures in Automated Deduction (PDPAR), 2006.
4. P. Fontaine and E. P. Gribomont. Combining non-stably infinite, non-first order theories. In Pragmatics of Decision Procedures in Automated Deduction, 2004.
5. P. Fontaine et al. Expressiveness + automation + soundness: Towards combining SMT solvers and interactive proof assistants. In Tools and Algorithms for the Construction and Analysis of Systems), vol. 3920 of LNCS, pp. 167-181. 2006.
6. S. Ghilardi, E. Nicolini, and D. Zucchelli. A comprehensive combination framework. ACM Transactions on Computational Logic, 2007. (to appear).
7. M. J. C. Gordon and T. F. Melham, editors. Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, 1993.
8. J. Grundy et al. Tool building requirements for an API to first-order solvers. ENTCS, 144(2): 15-26, 2006.
9. J. Harrison. Towards self-verification in HOL Light. In Automated Reasoning (IJCAR), vol. 4130 of LNAI. 2006.
10. S. Krstić et al. Combined satisfiability modulo parametric theories. Tech. report, Oct. 2006. (ftp : //ftp.cs.uiowa.edu/pub/t inelli/papers/KrsGGT-RR-06. pdf).
11. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems, 1(2):245-257, 1979.
12. R. Nieuwenhuis and A. Oliveras. Congruence closure with integer offsets. In Logic for Programming, AI and Reasoning (LPAR), vol. 2850 of LNCS, pp. 78-90. 2003.
13. R. Nieuwenhuis, A. Oliveras, and C. Tinelli. Solving SAT and SAT Modulo Theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). Journal of the ACM, 2006. (to appear).
14. T. Nipkow, L. C. Paulson, and M. Wenzel. Isabelle/HOL: A Proof Assistant for Higher-Order Logic, vol. 2283 of LNCS. 2002.
15. S. Ranise, C. Ringeissen, and C. G. Zarba. Combining data structures with nonstably infinite theories using many-sorted logic. In Frontiers of Combining Systems (FroCoS), vol. 3717 of LNCS, pp. 48-64. 2005.
16. S. Ranise and C. Tinelli. The SMT-LIB standard: Version 1.2. Technical report.
17. J. C. Reynolds. Types, abstraction and parametric polymorphism. In Information Processing: 9th World Computer Congress, pp. 513-523. North-Holland, 1983.
18. C. Ringeissen. Cooperation of decision procedures for the satisfiability problem. In Frontiers of Combining Systems (FroCoS), vol. 3 of Applied Logic, pp. 121-140.
19. N. Shankar. Using decision procedures with a higher-order logic. In Theorem Proving in Higher Order Logics (TPHOLS), vol. 2152 of LNCS, pp. 5-26, 2001.
20. C. Tinelli and M. Harandi. A new correctness proof of the Nelson-Oppen combination procedure. In Frontiers of Combining Systems (FroCoS), vol. 3 of Applied Logic, pp. 103-120. Kluwer, 1996.
21. C. Tinelli and C. Zarba. Combining decision procedures for sorted theories. In Logic in Artificial Intelligence (JELIA), vol. 3229 of LNAI, pp. 641-653. 2004.
22. C. Tinelli and C. Zarba. Combining nonstably infinite theories. Journal of Automated Reasoning, 34(3):209-238, 2005.
23. P. Wadler. Theorems for free! In Functional Programming Languages and Computer Architecture (FPCA), pp. 347-359. ACM Press, 1989.
24. C. G. Zarba. Combining sets with elements. In Verification: Theory and Practice, vol. 2772 of LNCS, pp. 762-782. 2004.