Efficient satisfiability modulo theories via delayed theory combination

Lecture Notes in Computer Science

Volumn 3576, Issue , 2005, Pages 335-349

  Bozzano, Marco ^a   Bruttomesso, Roberta ^a   Cimatti, Alessandro ^a   Junttila, Tommi ^b   Ranise, Silvio ^c   Van Rossum, Peter ^d   Sebastiani, Roberto ^e  

^a ITC IRST   (Italy)

^b AALTO UNIVERSITY   (Finland)

^c LORIA   (France)

^d RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

^e UNIVERSITY OF TRENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION THEORY; INTEGRATED CIRCUITS; INTEGRATION;

PREPOSITIONAL LOGICS; SATISFIABILITY MODULO THEORIES (SMT);

PROBLEM SOLVING;

EID: 26444487547     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11513988_34     Document Type: Conference Paper

References (29)

1. W. Ackermann. Solvable Cases of the Decision Problem. North Holland Pub. Co., 1954.
2. A. Armando, C. Castellini, E. Giunchiglia, and M. Maratea. A SAT-based Decision Procedure for the Boolean Combination of Difference Constraints. In Proc. SAT'04, 2004.
3. T. Ball, B. Cook, S.K. Lahiri, and L. Zhang. Zapato: Automatic Theorem Proving for Predicate Abstraction Refinement. In CAV 2004, volume 3114 of LNCS. Springer, 2004.
4. C. Barrett and S. Berezin. CVC Lite: A New Implementation of the Cooperating Validity Checker. In CAV 2004, volume 3114 of LNCS. Springer, 2004.
5. M. Bozzano, R. Bruttomesso, A. Cimatti, T. Junttila, S. Ranise, P.van Rossum, and R. Sebastiani. Efficient Theory Combination via Boolean Search. Technical Report T05-04-02, ITC-IRST, 2005.
6. M. Bozzano, R. Bruttomesso, A. Cimatti, T. Junttila, P. van Rossum, S. Schulz, and R. Sebastiani. An incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic. In TACAS 2005, volume 3440 of LNCS. Springer, 2005.
7. S. Cotton, E. Asarin, O. Maler, and P. Niebert. Some Progress in Satisfiability Checking for Difference Logic. In FORMATS/FTRTFT 2004, volume 3253 of LNCS. Springer, 2004.
8. CVC, CVCLITE and SVC. http://verify.Stanford.edu/{CVC, CVCL, SVC}.
9. D. Deharbe and S. Ranise. Light-Weight Theorem Proving for Debugging and Verifying Units of Code. In Proc. SEFM'03. IEEE Computer Society Press, 2003.
10. D. Detlefs, G. Nelson, and J.B. Saxe. Simplify: A Theorem Prover for Program Checking. Technical Report HPL-2003-148, HP Laboratories, 2003.
11. J.-C. Filliâtre, S. Owre, H. Rueß, and N. Shankar. ICS: Integrated Canonizer and Solver. In CAV 2001, volume 2102 of LNCS. Springer, 2001.
12. C. Flanagan, R. Joshi, X. Ou, and J.B. Saxe. Theorem Proving using Lazy Proof Explication. In CAV 2003, volume 2725 of LNCS. Springer, 2003.
13. H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, and C. Tinelli. DPLL(T): Fast decision procedures. In CAV 2004, volume 3114 of LNCS. Springer, 2004.
14. ICS. http://www.icansolve.com.
15. D. Kroening, J. Ouaknine, S. A. Seshia, and O. Strichman. Abstraction-Based Satisfiability Solving of Presburger Arithmetic. In CAV 2004, volume 3114 of LNCS. Springer, 2004.
16. MATHS AT. http://mathsat.itc.it.
17. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proc. DAC'01, pages 530-535. ACM, 2001.
18. G. Nelson and D.C. Oppen. Simplification by Cooperating Decision Procedures. ACM Trans. on Programming Languages and Systems, 1(2): 245-257, 1979.
19. R. Nieuwenhuis and A. Oliveras. Congruence Closure with Integer Offsets. In LPAR 2003, number 2850 in LNAI. Springer, 2003.
20. S. Ranise, C. Ringeissen, and D.-K. Tran. Nelson-Oppen, Shostak, and the Extended Canonizer: A Family Picture with a Newborn. In ICTAC 2004, volume 3407 of LNCS, 2005.
21. H. Rueß and N. Shankar. Deconstructing Shostak. In Proc. LICS'01, pages 19-28. IEEE Computer Society, 2001.
22. S.A. Seshia and R.E. Bryant. Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds. In Proc. LICS'04. IEEE, 2004.
23. S.A. Seshia, S.K. Lahiri, and R.E. Bryant. A Hybrid SAT-Based Decision Procedure for Separation Logic with Uninterpreted Functions. In DAC 2003. ACM, 2003.
24. N. Shankar and H. Rueß. Combining Shostak Theories. In RTA 2002, volume 2378 of LNCS. Springer, 2002.
25. O. Strichman. On Solving Presburger and Linear Arithmetic with SAT. In FMCAD 2002, volume 2517 of LNCS. Springer, 2002.
26. O. Strichman, S. Seshia, and R. Bryant. Deciding separation formulas with SAT. In CAV 2002, volume 2404 of LNCS. Springer, 2002.
27. C. Tinelli and M. Harandi. A New Correctness Proof of the Nelson-Oppen Combination Procedure. In Proc. FroCos'96. Kluwer Academic Publishers, 1996.
28. TSAT++. http://www.ai.dist.unige.it/Tsat.
29. UCLID. http://www-2.cs.cmu.edu/~;uclid.