Building efficient decision procedures on top of SAT solvers

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

Volumn 3965 LNCS, Issue , 2006, Pages 144-175

  Cimatti, Alessandro ^a   Sebastiani, Roberto ^b  

^a ITC IRST   (Italy)

^b UNIVERSITY OF TRENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; INTEGRATION; OPTIMIZATION; PROBLEM SOLVING;

EFFECTIVE INTEGRATION TECHNIQUES; THEORY-INDEPENDENT PERSPECTIVE; THEORY-SPECIFIC SOLVERS;

DECISION MAKING;

EID: 33745962637     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11757283_6     Document Type: Conference Paper

References (86)

1. Z. S. Andraus and K. A. Sakallah. Automatic abstraction and verification of verilog models. In Proc. DAC '04. ACM Press, 2004.
2. A. Armando, C. Castellini, and E. Giunchiglia. SAT-based procedures for temporal reasoning. In Proc. European Conference on Planning, CP-99, 1999.
3. A. Armando, C. Castellini, E. Giunchiglia, and M. Maratea. A SAT-based Decision Procedure for the Boolean Combination of Difference Constraints. In SAT'04 - The Seventh International Conference on Theory and Applications of Satisfiability Testing, Vancouver, BC, Canada, 2004. Presented at SAT 2004.
4. G. Audemard, P. Bertoli, A. Cimatti, A. Korniłowicz, and R. Sebastiani. A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions. In Proc. CADE'2002., volume 2392 of LNAI. Springer, July 2002.
5. G. Audemard, P. Bertoli, A. Cimatti, A. Korniłowicz, and R. Sebastiani. Integrating boolean and mathematical solving: Foundations, basic algorithms and requirements. In Proc. AISC-Calculemus 2002, volume 2385 of LNAI, pages 231-245. Springer, 2002.
6. G. Audemard, M. Bozzano, A. Cimatti, and R. Sebastiani. Verifying Industrial Hybrid Systems with MathSAT. In Proc. CAV'04 Workshop on Bounded Model Checking (BMC'04), volume 89 of ENTCS. Elsevier, 2004.
7. G. Audemard, A. Cimatti, A. Korniłowicz, and R. Sebastiani. SAT-Based Bounded Model Checking for Timed Systems. In Proc. FORTE'02., volume 2529 of LNCS. Springer, November 2002.
8. F. Bacchus and J. Winter. Effective Preprocessing with Hyper-Resolution and Equality Reduction. In Proc. Sixth International Symposium on Theory and Applications of Satisfiability Testing, 2003.
9. G. J. Badros and A. Borning. The Cassowary Linear Arithmetic Constraint Solving Algorith. ACM Transactions on Computer Human Interaction, 8(4):267-306, december 2001.
10. C. Barrett, D. Dill, and A. Stump. Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT. In 14th International Conference on Computer-Aided Verification, 2002.
11. C. W. Barrett, D, L. Dill, and J. R. Levitt. A decision procedure for bit-vector arithmetic. In Proc. DAC '98. ACM Press, 1998.
12. C. W. Barrett, D. L. Dill, and A. Stump. A generalization of Shostak's method for combining decision procedures. In Frontiers of Combining Systems (FROCOS), LNAI. Springer, April 2002. S. Margherita Ligure, Italy.
13. P. Baumgartner. FDPLL - A First Order Davis-Putnam-Longeman-Loveland Procedure. In Proceedings of CADE-17, pages 200-219. Springer, 2000.
14. P. Baumgartner and C. Tinelli. The Model Evolution Calculus. In F. Baader, editor, Proc. CADE-19, number 2741 in LNAI, pages 350-364. Springer, 2003.
15. R. J. Bayardo and R. C. Schrag. Using CSP Look-Back Techniques to Solve Real-World SAT instances. In Proc. AAAI'97, pages 203-208. AAAI Press, 1997.
16. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Proc. CAV'99, 1999.
17. A. Bockmayr and V. Weispfenning. Solving Numerical Constraints. In Handbook of Automated Reasoning, pages 751-842. MIT Press, 2001.
18. A. Borälv. A Fully Automated Approach for Proving Safety Properties in Interlocking Software Using Automatic Theorem-Proving. In S. Gnesi and D. Latella, editors, Proceedings of the Second International ERCIM Workshop on Formal Methods for Industrial Critical Systems, Pisa, Italy, July 1997.
19. M. Bozzano, R. Bruttomesso, A. Cimatti, A. Franzén, Z. Hanna, Z. Khasidashvili, A. Palti, and R. Sebastiani. Encoding RTL Constructs for MathSAT: a Preliminary Report. In Proc. 3rd Workshop of Pragmatics on Decision Procedure in Automated Reasoning, PDPAR'05, ENTCS. Elsevier, 2006. To appear.
20. M. Bozzano, R. Bruttomesso, A. Cimatti, T. Junttila, P.van Rossum, S. Ranise, and R. Sebastiani. Efficient Satisfiability Modulo Theories via Delayed Theory Combination. In Proc. Int. Conf. on Computer-Aided Verification, CAV 2005., volume 3576 of LNCS. Springer, 2005.
21. 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 Proc. TACAS'05, volume 3440 of LNCS. Springer, 2005.
22. M. Bozzano, R. Bruttomesso, A. Cimatti, T. Junttila, P.van Rossum, S. Schulz, and R. Sebastiani. MathSAT: A Tight Integration of SAT and Mathematical Decision Procedure. Journal of Automated Reasoning, 2006. To appear.
23. M. Bozzano, R. Bruttomesso, A. Cimatti, T. Junttila, P. van Rossum, S. Ranise, and R. Sebastiani. Theory Combination via Boolean Search, Information and Computation, 2006. To appear.
24. R. Brafman. A simplifier for propositional formulas with many binary clauses. In Proc. IJCAIOI, 2001.
25. R. Brinkmann and R. Drechsler. RTL-datapath verification using integer linear programming. In Proc. ASP-DAC 2002, pages 741-746. IEEE, 2002.
26. R. Bruttomesso, A. Cimatti, A. Franzèn, A. Griggio, and R. Sebastiani. Delayed Theory Combination vs. Nelson-Oppen for Satisfiability Modulo Theories: a Comparative Analysis. Submitted for publication., March 2006.
27. R. E. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C-35(8):677-691, August 1986.
28. J. R. Burch and D. L. Dill. Automatic Verification of Pipelined Microprocessor Control. In Proc. CAV '94, volume 818 of LNCS. Springer, 1994.
29. C. Castellini, E. Giunchiglia, and A. Tacchella. Sat-based planning in complex domains: Concurrency, constraints and nondeterminism. Artificial Intelligence, 147(1-2):85-117, 2003.
30. B. V. Cherkassky and A. V. Goldberg. Negative-cycle detection algorithms. Mathematical Programming, 85(2):277-311, 1999.
31. D. Cyrluk, M. Oliver Möller, and H. Ruess. An efficient decision procedure for the theory of fixed-sized bit-vectors. In Proceedings of CAV'97, pages 60-71, 1997.
32. M. Davis, G. Longemann, and D. Loveland. A machine program for theorem proving. Journal of the ACM, 5(7), 1962.
33. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201-215, 1960.
34. L. de Moura, H. Rueß, and M. Sorea. Lazy theorem proving for bounded model checking over infinite domains. In Proc. of the 18th International Conference on Automated Deduction, volume 2392 of LNCS, pages 438-455. Springer, July 2002.
35. L. de Moura, H. Rueß, and M. Sorea. Lemmas on Demand for Satisfiability Solvers. Presented at the Fifth International Symposium on the Theory and Applications of Satisfiability Testing (SAT'02), Cincinnati, USA, 15 May 2002, May 2002.
36. L. deMoura, H. Ruess, and N. Shankar. Justifying Equality. In Proc. PDPAR'04, volume 68 (5) of ENTCS. Elsevier, 2004.
37. D. Detlefs, G. Nelson, and J. Saxe. Simplify: A theorem prover for program checking, 2003. Technical Report HPL-2003-148, HP Labs, Palo Alto, CA. http://www.hpl.hp.com/techreports/2003/HPL-2003-148.ps.
38. N. Een and A. Biere. Effective Preprocessing in SAT Through Variable and Clause Elimination. In proc. SAT'05, volume 3569 of LNCS. Springer, 2005.
39. N. Eén and N. Sörensson. An extensible SAT-solver. In Theory and Applications of Satisfiability Testing (SAT 2003), volume 2919 of LNCS, pages 502-518. Springer, 2004.
40. J.-C. Filliâtre, S. Owre, H. Rueß, and N. Shankar. ICS: Integrated Canonizer and Solver. Proc. CAV'2001, 2001.
41. C. Flanagan, R. Joshi, X. Ou, and J. B. Saxe. Theorem Proving Using Lazy Proof Explication. In Proc. CAV 2003, LNCS. Springer, 2003.
42. G. Stålmarck and M. Säflund. Modelling and Verifying Systems and Software in Propositional Logic. Ifac SAFECOMP'90, 1990.
43. H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, and C. Tinelli. DPLL(T): Fast Decision Procedures. In Proc. CAV'04, volume 3114 of LNCS. Springer, 2004.
44. E. Giunchiglia, F. Giunchiglia, R. Sebastiani, and A. Tacchella. SAT vs. Translation based decision procedures for modal logics: a comparative evaluation. Journal of Applied Non-Classical Logics, 10(2):145-172, 2000.
45. E. Giunchiglia, F. Giunchiglia, and A. Tacchella. SAT Based Decision Procedures for Classical Modal Logics. Journal of Automated Reasoning. Special Issue: Satisfiability at the start of the year 2000, 2001.
46. E. Giunchiglia, A. Massarotto, and R. Sebastiani. Act, and the Rest Will Follow: Exploiting Determinism in Planning as Satisfiability. In Proc. AAAI'98, pages 948-953, 1998.
47. E. Giunchiglia and R. Sebastiani. Applying the Davis-Putnam procedure to non-clausal formulas. In Proc. AI*IA'99, volume 1792 of LNAI. Springer, 1999.
48. F. Giunchiglia and R. Sebastiani. Building decision procedures for modal logics from prepositional decision procedures - the case study of modal K. In CADE-13, LNAI, New Brunswick, NJ, USA, August 1996. Springer Verlag.
49. F. Giunchiglia and R. Sebastiani. A SAT-based decision procedure for ALC. In Proc. of the 5th International Conference on Principles of Knowledge Representation and Reasoning - KR'96, Cambridge, MA, USA, November 1996.
50. F. Giunchiglia and R. Sebastiani. Building decision procedures for modal logics from prepositional decision procedures - the case study of modal K(m). Information and Computation, 162(1/2), October/November 2000.
51. E. Goldberg and Y. Novikov. BerkMin: A Fast and Robust SAT-Solver. In Proc. DATE '02, page 142, Washington, DC, USA, 2002. IEEE Computer Society.
52. C. P. Gomes, B. Selman, and H. Kautz. Boosting combinatorial search through randomization. In Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI'98), pages 431-437, Madison, Wisconsin, 1998.
53. J. Hoffmann and R. I. Brafman. Contingent planning via heuristic forward search witn implicit belief states. In Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling (ICAPS 2005), pages 71-80. AAAI, 2005.
54. J. N. Hooker and V. Vinay. Branching Rules for Satisfiability. Journal of Automated Reasoning, 15(3):359-383, 1995.
55. I. Horrocks. The FaCT system. In H. de Swart, editor, Proc. TABLEAUX-98, volume 1397 of LNAI, pages 307-312. Springer, 1998.
56. H. Kautz, D. McAllester, and B. Selman. Encoding Plans in Prepositional Logic. In Proc. KR'96, 1996.
57. S. K. Lahiri and R. E. Bryant. Deductive verification of advanced out-of-order microprocessors. In Proceedings of CAV, pages 341-353, 2003.
58. T. Latvala, A. Biere, K. Heljanko, and T. Junttila. Simple Bounded LTL Model Checking. In Proc. FMCAD'04, volume 3312 of LNCS. Springer, 2004.
59. C. M. Li and Anbulagan. Heuristics based on unit propagation for satisfiability problems. In Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97), pages 366-371, 1997.
60. M. Mahfoudh, P. Niebert, E. Asarin, and O. Maler. A Satisfiability Checker for Difference Logic. In Proceedings of SAT-02, pages 222-230, 2002.
61. K. McMillan. Applying SAT Methods in Unbounded Symbolic Model Checking. In Proc. CAV '02, number 2404 in LNCS. Springer, 2002.
62. M. O. Möller and H. Ruess. Solving bit-vector equations. In Proceedings of FMCAD'98, pages 36-48, 1998.
63. M. W. Moskewicz, C. F. Madigan, Y. Z., L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Design Automation Conference, 2001.
64. G. Nelson and D.C. Oppen. Simplification by Cooperating Decision Procedures. ACM Trans. on Programming Languages and Systems, 1(2):245-257, 1979.
65. R. Nieuwenhuis and A. Oliveras. Congruence closure with integer offsets. In In 10th Int. Conf. Logic for Programming, Artif. Intell. and Reasoning (LPAR), volume 2850 of LNAI, pages 78-90. Springer, 2003.
66. R. Nieuwenhuis and A. Oliveras. DPLL(T) with Exhaustive Theory Propagation and its Application to Difference Logic. In Proc. CAV'05, volume 3576 of LNCS. Springer, 2005.
67. R. Nieuwenhuis, A. Oliveras, and C. Tinelli. Abstract DPLL and Abstract DPLL Modulo Theories. In Proc. LPAR'04, volume 3452 of LNCS. Springer, 2005.
68. P. F. Patel-Schneider. DLP system description. In Proc. DL-98, pages 87-89, 1998.
69. S. Ranise and C. Tinelli. The SMT-LIB Standard. Available at http://combination.cs.uiowa.edu/smtlib/.
70. R. Sebastiani. Integrating SAT Solvers with Math Reasoners: Foundations and Basic Algorithms. ITC-IRST Technical report., November 2001.
71. S. A. Seshia, S. K. Lahiri, and R. E. Bryant. A Hybrid SAT-Based Decision Procedure for Separation Logic with Uninterpreted Functions. In Proc. DAC'03, 2003.
72. N. Shankar and H. Rueß. Combining shostak theories. Invited paper for Floc'02/RTA'02, 2002.
73. R. Shostak. A Pratical Decision Procedure for Arithmetic with Function Symbols. Journal of the ACM, 26(2):351-360, 1979.
74. J. P. M. Silva and K. A. Sakallah. GRASP - A new Search Algorithm for Satisfiability. In Proc. ICCAD'96, 1996.
75. P. Stephan, R. Brayton, and A. Sangiovanni-Vincentelli. Combinational Test Generation Using Satisfiability. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 15:1167-1176, 1996.
76. O. Strichman, Tuning SAT checkers for Bounded Model Checking. In Proc. CAV00, volume 1855 of LNCS, pages 480-494. Springer, 2000.
77. O. Strichman, S. Seshia, and R. Bryant. Deciding separation formulas with SAT. In Proc. of Computer Aided Verification, (CAV'02), LNCS. Springer, 2002.
78. A. Stump, C. W. Barrett, and D. L. Dill. CVC: A Cooperating Validity Checker. In Proc. CAV'02, number 2404 in LNCS. Springer Verlag, 2002.
79. C. Thiffault, F. Bacchus, and T. Walsh. Solving Non-clausal Formulas with DPLL Search. In proc. 7th Int. Conference on Theory and Applications of Satisfiability Testing (SAT 2004, LNCS. Springer, 2004.
80. C. Tinelli. A DPLL-based Calculus for Ground Satisfiability Modulo Theories. In Proc. JELIA-02, volume 2424 of LANI, pages 308-319. Springer, 2002.
81. M. Velev and R. E. Bryant. Exploiting Positive Equality and Partial Non-Consistency in the Formal Verification of Pipelined Microprocessors. In Design Automation Conference, pages 397-401, 1999.
82. S. Wolfman and D. Weld. The LPSAT Engine & its Application to Resource Planning. In Proc. IJCAI, 1999.
83. S. Wolfman and D. Weld. Combining linear programming and satisfiability solving for resource planning. Knowledge Engineering Review, 2000.
84. Z. Zeng, P. Kalla, and M. Ciesielski. LPSAT: a unified approach to RTL satisfiability. In Proc. DATE '01. IEEE Press, 2001.
85. L. Zhang, C. F. Madigan, M. H. Moskewicz, and S. Malik. Efficient conflict driven learning in a boolean satisfiability solver. In Proc. ICCAD '01, pages 279-285. IEEE Press, 2001.
86. L. Zhang and S. Malik. The quest for efficient boolean satisfiability solvers. In Proc. CAV'02, number 2404 in LNCS, pages 17-36. Springer, 2002.