Decision procedures for SAT, SAT modulo theories and beyond. The BarcelogicTools

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

Volumn 3835 LNAI, Issue , 2005, Pages 23-46

  Nieuwenhuis, Robert ^b   Oliveras, Albert ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT DPLL MODULO THEORIES; BARCELOGICTOOLS; SAT MODULO THEORIES (SMT);

COMPUTER AIDED SOFTWARE ENGINEERING; DECISION MAKING; FORMAL LOGIC; SOFTWARE ENGINEERING; SYSTEMS ANALYSIS;

THEOREM PROVING;

EID: 33745456148     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11591191_3     Document Type: Conference Paper

References (46)

1. +02] G. Audemard, P. Bertoli, A. Cimatti, A. Kornilowicz, and R. Sebastiani. A SAT based approach for solving formulas over boolean and linear mathematical propositions. In CADE-18, LNCS 2392, pages 195-210, 2002.
2. [ACG00] Alessandro Armando, Claudio Castellini, and Enrico Giunchiglia. SAT-based procedures for temporal reasoning. In Susanne Biundo and Maria Fox, editors, Proceedings of the 5th European Conference on Planning (Durham, UK), volume 1809 of Lecture Notes in Computer Science, pages 97-108. Springer, 2000.
3. [ACGM04] Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, and Marco Maratea. A SAT-based Decision Procedure for the Boolean Combination of Difference Constraints. In 7th International Conference on Theory and Applications of Satisfiability Testing(SAT 8004). LNCS, 2004.
4. [Ack54] Wilhelm Ackermann. Solvable Cases of the Decision Problem. Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, 1954.
5. [Alu99] Rajeev Alur. Timed automata. In Nicolas Halbwachs and Doron Peled, editors, Proceedings of the 11th International Conference on Computer Aided Verification, CAV'99 (Trento, Italy), volume 1633 of Lecture Notes in Computer Science, pages 8-22. Springer, 199.
6. [Bar03] Clark W. Barrett. Checking Validity of Quantifier-Free Formulas in Combinations of First-Order Theories. PhD thesis, Stanford University, 2003.
7. [BB04] Clark W. Barrett and Sergey Berezin. CVC lite: A new implementation of the cooperating validity checker category b. In R. Alur and D. Pelod, editors, Proceedings of the 16th International Conference on Computer Aided Verification, CAV'04 (Boston, Massachusetts), volume 3114 of Lecture Notes in Computer Science, pages 515-518. Springer, 2004.
8. +05] M. Bozzano, R. Bruttomesso, A.Cimatti, T.Junttila, P.v.Rossum, S.Schulz, and R.Sebastiani. An incremental and layered procedure for the satisfiability of linear arithmetic logic. In Tools and Algorithms for the Construction and Analysis of Systems, 11th Int. Conf., (TACAS), volume 3440 of Lecture Notes in Computer Science, pages 317-333, 2005.
9. +05] Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Silvio Ranise, Peter van Rossum, and Roberto Sebastiani. Efficient satisfiability modulo theories via delayed theory combination. In Int. Conf. on Computer Aided Verification (CAV), volume 3576 of Lecture Notes in Computer Science, pages 335-349, 2005.
10. [BCLZ04] Thomas Ball, Byron Cook, Shuvendu K. Lahiri, and Lintao Zhang. Zapato: Automatic theorem proving for predicate abstraction refinement. In R. Alur and D. Peled, editors, Proceedings of the 16th International Conference on Computer Aided Verification, CAV'04 (Boston, Massachusetts), volume 3114 of Lecture Notes in Computer Science, pages 457-461. Springer, 2004.
11. [BD94] J. R. Burch and D. L. Dill. Automatic verification of pipelined microprocessor control. In Procs. 6th Int. Conf. Computer Aided Verification (CAV), LNCS 818, pages 68-80, 1994.
12. [BDL96] C. Barrett, D. L. Dill, and J. Levitt. Validity checking for combinations of theories with equality. In Procs. 1st Intl. Conference on Formal Methods in Computer Aided Design, LNCS 1166, pages 187-201, 1996.
13. [BdMS05] C. Barrett, L. de Moura, and A. Stump. SMT-COMP: Satisfiability Modulo Theories Competition. In K. Etessami and S. Rajamani, editors, 17th International Conference on Computer Aided Verification, Lecture Notes in Computer Science, pages 20-23. Springer, 2005. Results at: www.csl.sri.com/ users/demoura/smt-comp.
14. [BDS02] Clarke Barrett, David Dill, and Aaron Stump. Checking satisfiability of first-order formulas by incremental translation into sat. In Procs. 14th Intl. Conf. on Computer Aided Verification (CAV), LNCS 2404, 2002.
15. [BEGJ00] Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, and Jan Johannsen. On the relative complexity of resolution refinements and cutting planes proof systems. SIAM J. Comput., 30(5):1462-1484, 2000.
16. [BGV01] R. Bryant, S. German, and M. Velev. Processor verification using efficient reductions of the logic of uninterpreted functions to prepositional logic. ACM Trans. Computational Logic, 2(1):93-134, 2001.
17. [BKS03] Paul Beame, Henry Kautz, and Ashish Sabharwal. On the power of clause learning. In Proceedings of IJCAI-03, 18th International Joint Conference on Artificial Intelligence, Acapulco, MX, 2003.
18. [BV02] Randal E. Bryant and Miroslav N. Velev. Boolean satisfiability with transitivity constraints. ACM Trans. Computational Logic, 3(4):604-627, 2002.
19. [DLL62] Martin Davis, George Logemann, and Donald Loveland. A machine program for theorem-proving. Comm. of the ACM, 5(7):394-397, 1962.
20. [dMR02] Leonardo de Moura and Harald Rueß. Lemmas on demand for satisfiability solvers. In Procs. 5th Int. Symp. on the Theory and Applications of Satisfiability Testing, SAT'02, pages 244-251, 2002.
21. [dMR04] Leonardo de Moura and Harald Ruess. An experimental evaluation of ground decision procedures. In R. Alur and D. Peled, editors, Proceedings of the 16th International Conference on Computer Aided Verification, CAV'04 (Boston, Massachusetts), volume 3114 of Lecture Notes in Computer Science, pages 162-174. Springer, 2004.
22. [dMRS04] Leonardo de Moura, Harald Rueß, and Natarajan Shankar. Justifying equality. In Proceedings of the Second Workshop on Pragmatics of Decision Procedures in Automated Reasoning, Cork, Ireland, 2004.
23. [DP60] Martin Davis and Hilary Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201-215, 1960.
24. [DST80] Peter J. Downey, Ravi Sethi, and Robert E. Tarjan. Variations on the common subexpressions problem. J. of the Association for Computing Machinery, 27(4):758-771, 1980.
25. [ES03] Niklas Eén and Niklas Sörensson. An extensible sat-solver. In Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT), pages 502-518, 2003.
26. [FJOS03] C. Flanagan, R. Joshi, X. Ou, and J. B. Saxe. Theorem proving using lazy proof explanation. In Procs. 15th Int. Conf. on Computer Aided Verification (CAV), LNCS 2725, 2003.
27. [FORS01] J.-C. Filliâtre, S. Owre, H. Rueß, and N. Shankar. ICS: Integrated Canonization and Solving (Tool prese ntation). In G. Berry, H. Comon, and A. Finkel, editors, Proceedings of CAV'2001, volume 2102 of Lecture Notes in Computer Science, pages 246-249. Springer-Verlag, 2001.
28. +04] Harald Ganzinger, George Hagen, Robert Nieuwenhuis, Albert Oliveras, and Cesare Tinelli. DPLL(T): Fast Decision Procedures. In R. Alur and D. Peled, editors, Proceedings of the 16th International Conference on Computer Aided Verification, CAV'04 (Boston, Massachusetts), volume 3114 of Lecture Notes in Computer Science, pages 175-188. Springer, 2004.
29. [GN02] E. Goldberg and Y. Novikov. BerkMin: A fast and robust SAT-solver. In Design, Automation, and Test in Europe (DATE '02), pages 142-149, 2002.
30. [LS04] Shuvendu K. Lahiri and Sanjit A. Seshia. The uclid decision procedure. In Computer Aided Verification, 16th International Conference, (CAV), volume 3114 of Lecture Notes in Computer Science, pages 475-478, 2004.
31. +01] Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Chaff: Engineering an Efficient SAT Solver. In Proc. 38th Design Automation Conference (DAC'01), 2001.
32. [MSO5a] Panagiotis Manolios and Sudarshan K. Srinivasan. A computationally efficient method based on commitment refinement maps for verifying pipelined machines. In ACM IEEE Int. Conf. on Formal Methods and Models for Co-Design (MEMOCODE), 2005.
33. [MS05b] Panagiotis Manolios and Sudarshan K. Srinivasan. Refinement maps for efficient verification of processor models. In Design, Automation and Test in Europe Conference and Exposition (DATE), pages 1304-1309. IEEE Computer Society, 2005.
34. [MSS99] Joao Marques-Silva and Karem A. Sakallah. GRASP: A search algorithm for propositional satisfiability. IEEE Trans. Comput., 48(5):506-521, may 1999.
35. [NO79] Greg Nelson and Derek C. Oppen. Simplification by cooperating decision procedures. ACM Trans. Program. Lang. Syst., 1(2):245-257, 1979.
36. [NO03] Robert Nieuwenhuis and Albert Oliveras. Congruence Closure with Integer Offsets. In M Vardi and A Voronkov, editors, 10h Int. Conf. Logic for Programming, Artif. Intell. and Reasoning (LPAR), LNAI 2850, pages 78-90, 2003.
37. [NOO5a] Robert Nieuwenhuis and Albert Oliveras. BarcelogicTools for SMT, July 2005. SMT Competition 2005. Entrants' system descriptions. www.csl.sri.com/users/demoura/smt-comp.
38. [NO25b] Robert Nieuwenhuis and Albert Oliveras. DPLL(T) with Exhaustive Theory Propagation and its Application to Difference Logic. In Kousha Etessami and Sriram K. Rajamani, editors, Proceedings of the 17th International Conference on Computer Aided Verification, CAV'05 (Edimburgh, Scotland), volume 3576 of Lecture Notes in Computer Science, pages 321-334. Springer, July 2005.
39. [NOO5c] Robert Nieuwenhuis and Albert Oliveras. Proof-Producing Congruence Closure. In Jürgen Giesl, editor, Proceedings of the 16th International Conference on Term Rewriting and Applications, RTA '05 (Nara, Japan), volume 3467 of Lecture Notes in Computer Science, pages 453-468. Springer, June 2005.
40. [NOT05] Robert Nieuwenhuis, Albert Oliveras, and Cesare Tinelli. Abstract DPLL and Abstract DPLL Modulo Theories. In Franz Baader and Andrei Voronkov, editors, "11th Int. Conf. Logic for Programming, Artif. Intell. and Reasoning (LPAR)", volume 3452 of Lecture Notes in Computer Science, pages 36-50. Springer, 2005.
41. [RT03] Silvio Ranise and Cesare Tinelli. The SMT-LIB Format: An Initial Proposal. In Proceedings of the 1st Workshop on Pragmatics of Decision Procedures in Automated Reasoning, Miami, 2003.
42. [Rya04] Lawrence Ryan. Efficient Algorithms for Clause-Learning SAT Solvers. Master's thesis, School of Computing Science, Simon Fraser University, 2004.
43. [Sho84] Robert E. Shostak. Deciding combinations of theories. Journal of the ACM, 31(1):1-12, January 1984.
44. [ST05] Aaron Stump and Li-Yang Tan. The algebra of equality proofs. In Jürgen Giesl, editor, Proceedings of the 16th International Conference on Term Rewriting and Applications, RTA '05 (Nara, Japan), volume 3467 of Lecture Notes in Computer Science, pages 469-483. Springer, 2005.
45. [Str02] Ofer Strichman. On solving presburger and linear arithmetic with sat. In Mark Aagaard and John W. O'Leary, editors, Formal Methods in Computer-Aided Design, 4th International Conference, FMCAD 2002, Portland, OR, USA, November 6-8, 2002, Proceedings, volume 2517 of Lecture Notes in Computer Science, pages 160-170. Springer, 2002.
46. [ZMMM01] L. Zhang, C. F. Madigan, M. W. Moskewicz, and S. Malik. Efficient conflict driven learning in a Boolean satisfiability solver. In Int. Conf. on Computer-Aided Design (ICCAD'01), pages 279-285, 2001.