Efficient theory combination via boolean search

Information and Computation

Volumn 204, Issue 10, 2006, Pages 1493-1525

  Bozzano, Marco ^a   Bruttomesso, Roberto ^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

FORMAL LOGIC; INTEGER PROGRAMMING;

BACKGROUND THEORY; DECISION PROCEDURE; EXPERIMENTAL EVIDENCE; LINEAR ARITHMETIC; SATISFIABILITY MODULO THEORIES; SEARCH TECHNIQUE; STATE OF THE ART; UNINTERPRETED FUNCTIONS;

DECISION THEORY;

EID: 84855198570     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2005.05.011     Document Type: Article

References (41)

1. A. Armando, C. Castellini, E. Giunchiglia, M. Maratea, ASAT-based decision procedure for the boolean combination of difference constraints, in: Proceedings of SAT'04, 2004.
2. W. Ackermann, Solvable Cases of the Decision Problem, North Holland, Amsterdam, 1954.
3. C. L. Barrett, S. Berezin, CVC Lite: a new implementation of the cooperating validity checker, in: Proceedings of CAV'04, Lecture Notes in Computer Sciences, vol. 3114, Springer, Berlin, 2004.
4. M. Bozzano, R. Bruttomesso, A. Cimatti, T. Junttila, P. van Rossum, S. Ranise, R. Sebastiani, Efficient satisfiability modulo theories via delayed theory combination, in: Proceedings of CAV 2005, Lecture Notes in Computer Sciences, vol. 3576, Springer, Berlin, 2005.
5. M. Bozzano, R. Bruttomesso, A. Cimatti, T. Junttila, P. van Rossum, S. Schulz, R. Sebastiani, An incremental and layered procedure for the satisfiability of linear arithmetic logic, in: Proceedings of TACAS'05, Lecture Notes in Computer Sciences, vol. 3440, Springer, Berlin, 2005.
6. T. Ball, B. Cook, S. K. Lahiri, L. Zhang, Zapato: automatic theorem proving for predicate abstraction refinement, in: CAV, Lecture Notes in Computer Sciences, vol. 3114, 2004.
7. C. W. Barret, D. L. Dill, A. Stump, A generalization of Shostak's method for combining decision procedures, in: Proceedings of FROCOS'02, 2002.
8. R. J. Bayardo Jr, R. C. Schrag, Using CSP look-back techniques to solve real-world SAT instances, in: Proceedings of AAAI/IAAI'97, AAAI Press, 1997, pp. 203-208.
9. S. Cotton, E. Asarin, O. Maler, P. Niebert, Some progress in satisfiability checking for difference logic, in: Proceedings of FORMATS-FTRTFT 2004, 2004.
10. CVC, CVCL, SVC. Available from: .
11. N. Dershowitz, J.-P. Jouannaud, Rewrite systems, in: in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Elsevier and MIT Press, Amsterdam/Cambridge, MA, 1990, pp. 243-320.
12. D. Deharbe, S. Ranise, Light-Weight theorem proving for debugging and verifying units of code, in: Proceedings of SEFM'03, IEEE Computer Society Press, Sliver Spring, MD, 2003.
13. H. B. Enderton, A Mathematical Introduction to Logic, Academic Press, New York, 1972.
14. N. Eén, N. Sörensson, An extensible SAT-solver, in: Theory and Applications of Satisfiability Testing (SAT 2003), Lecture Notes in Computer Sciences, vol. 2919, Springer, Berlin, 2004, pp. 502-518.
15. C. Flanagan, R. Joshi, X. Ou, J. B. Saxe, Theorem proving using lazy proof explication, in: Proceedings of the CAV'03, Lecture Notes in Computer Sciences, vol. 2725, Springer, Berlin, 2003, pp. 355-367.
16. J.-C. Filliâtre, S. Owre, H. Rueß, N. Shankar, ICS: integrated canonizer and solver, in: Proceedings of CAV'01, Lecture Notes in Computer Sciences, vol. 2102, 2001, pp. 246-249. (Pubitemid 33312920)
17. H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, C. Tinelli, DPLL (T): fast decision procedures, in: Proceedings of CAV'04, Lecture Notes in Computer Sciences, vol. 3114, Springer, Berlin, 2004, pp. 175-188.
18. C. Gomes, B. Selman, H. Kautz, Boosting combinatorial search through randomization, in: Proceedings of the Fifteenth National Conference on Artificial Intelligence, American Association for Artificial Intelligence, 1998, pp. 431-437.
19. ICS. Available from: .
20. D. Kroening, J. Ouaknine, S. Seshia, O. Strichman, Abstraction-based satisfiability solving of Presburger arithmetic, in: Proceedings of CAV'04, Lecture Notes in Computer Sciences, vol. 3114, Springer, Berlin, 2004, pp. 308-320.
21. MathSAT. Available from: .
22. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, S. Malik, Chaff: engineering an efficient SAT solver, in: Proceedings of the DAC'01, ACM, 2001, pp. 530-535. (Pubitemid 32841010)
23. G. Nelson, D. C. Oppen, Simplification by cooperating decision procedures, ACM Trans. Programm. Lang. Syst. 1(2) (1979) 245-257.
24. R. Nieuwenhuis, A. Oliveras, Congruence closure with integer offsets, in: Proceedings of the 10th LPAR, number 2850 in LNAI, Springer, Berlin, 2003, pp. 77-89.
25. D. C. Oppen, Complexity, convexity and combinations of theories, Theor. Comput. Sci. 12(1980) 291-302.
26. S. Ranise, C. Ringeissen, D.-K. Tran, Nelson-Oppen, Shostak, and the extended canonizer: a family picture with a newborn, in: Proceedings of the ICTAC'04, 2004.
27. H. Rueß, N. Shankar, Deconstructing Shostak, in: Proceedings of the LICS'01, IEEE Computer Society, 2001, pp. 19-28. (Pubitemid 32795614)
28. S. A. Seshia, R. E. Bryant, Deciding quantifier-free Presburger formulas using parameterized solution bounds, in: Proceedings of the LICS'04, 2004.
29. S. Schulz, E-A Brainiac Theorem Prover, AI Commun. 15 (2/3) (2002) 111-126.
30. R. E. Shostak, Deciding combinations of theories, J. ACM 31(1984) 1-12.
31. S. A. Seshia, S. K. Lahiri, R. E. Bryant, A hybrid SAT-based decision procedure for separation logic with uninterpreted functions, in: Proceedings of the DAC'03, 2003.
32. N. Shankar, H. Rueß, Combining Shostak theories, in: RTA, vol. 2378, 2002.
33. J. P. M. Silva, K. A. Sakallah, GRASP-a new search algorithm for satisfiability, in: Proceedings of the ICCAD'96, ACM, 1996, pp. 220-227.
34. O. Strichman, S. Seshia, R. Bryant, Deciding separation formulas with SAT, in: Proceedings of the Computer Aided Verification, (CAV'02), Lecture Notes in Computer Sciences, Springer, Berlin, 2002.
35. O. Strichman, On solving Presburger and linear arithmetic with SAT, in: Proceedings of Formal Methods in Computer-Aided Design (FMCAD 2002), Lecture Notes in Computer Sciences, Springer, Berlin, 2002.
36. C. Tinelli, M. Harandi, A new correctness proof of the Nelson-Oppen combination procedure, in: Proceedings of the FROCOS'96, 1996.
37. C. Tinelli, C. Ringeissen, Unions of non-disjoint theories and combinations of satisfiability procedures, Theor. Comput. Sci. 290(1) (2003) 291-353. (Pubitemid 35264426)
38. TSAT++. Available from: .
39. C. Tinelli, C. G. Zarba, Combining non-stably infinite theories, J. Automated Reasoning (2005) (to appear).
40. UCLID. Available from: .
41. C. G. Zarba, Combining sets with integers, in: A. Armando (Ed.), Proceedings of the FROCOS'02, Lecture Notes in Computer Sciences, vol. 2309, Springer, Berlin, 2002, pp. 103-116.