Beyond boolean SAT: Satisfiability modulo theories

Proceedings - 9th International Workshop on Discrete Event Systems, WODES' 08

Volumn , Issue , 2008, Pages 68-73

  Cimatti, Alessandro ^a  

^a ITC IRST   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; SURFACE MOUNT TECHNOLOGY; TECHNICAL PRESENTATIONS;

BACKGROUND THEORY; CONTINUOUS DYNAMICS; DATA FLOWS; DISCRETE EVENT SYSTEMS; DYNAMIC SYSTEMS; EXPRESSIVE POWER; FIRST ORDER LOGIC; INTEGER VARIABLES; MODULO THEORIES; REAL TIME; SAT SOLVERS; SATISFIABILITY; SATISFIABILITY MODULO THEORY; VERIFICATION PROBLEMS;

BOOLEAN FUNCTIONS;

EID: 53149104349     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WODES.2008.4605924     Document Type: Conference Paper

References (58)

1. E. Ábrahám, B. Becker, F. Klaedtke, and M. Steffen. Optimizing Bounded Model Checking for Linear Hybrid Systems, In Radhia Cousot, editor, VMCAI, volume 3385 of LNCS, pages 396-412. Springer, 2005.
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. Kornil{stroke}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, M. Bozzano, A. Cimatti, and R. Sebastiani. Verifying Industrial Hybrid Systems with MafhSAT. Electr. Notes Theor. Comput. Sci., 119(2): 17-32, 2005.
6. T. Ball and R. Jones, editors. Computer Aided Verification, 18th International Conference, CAV 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings, volume 4144 of LNCS. Springer, 2006.
7. C. Barrett, D. Dill, and A. Stump. Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT. In E. Brinksma and K. Larsen, editors, 14th International Conference on Computer Aided Verification (CAV), volume 2404 of LNCS, pages 236-249, Copenhagen, Denmark, 2002. Springer.
8. C. Barrett, D. 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.
9. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Proc. CAV'99, 1999.
10. 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 FMICS'97, Pisa, Italy, July 1997.
11. M. Bozzano, R. Bruttomesso, A. Cimatti, A. Franzén, Z. Hanna, Z. Khasidashvili, A. Paid, and R. Sebastiani. Encoding RTL Constructs for MathSAT: a Preliminary Report. Electr. Notes Theor. Comput. Sci., 144(2):3-14, 2006.
12. M. Bozzano, R. Bruttomesso, A. Cimatti, T. Junttila, S. Ranise, P. van Rossum, and R. Sebastiani. Efficient theory combination via boolean search. Inf. Comput., 204(10):1493-1525, 2006.
13. 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.
14. 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.
15. M. Bozzano, R. Bruttomesso, A. Cimatti, T. Junttila, P. van Rossum, S. Schulz, and R. Sebastiani. MathSAT: Tight Integration of SAT and Mathematical Decision Procedures. J. Autom. Reasoning, 35(1-3):265-293, 2005.
16. R. Bruttomesso, A. Cimatti, A. Franzén, A. Griggio, Z. Hanna, A. Nadel, A. Paid, and R. Sebastiani. A Lazy and Layered SMT(BV) Solver for Hard Industrial Verification Problems. In Damm and Hermanns [24], pages 547-560.
17. 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.
18. R. Cavada, A. Cimatti, A. Franzén, K. Krishnamani, and R. Shyamasundar. Computing Predicate Abstractions by Combining BDDs and SMT. In Proceedings of FMCAD'07, Austin, TX, 2007.
19. A. Cimatti, A. Griggio, and R. Sebastiani. Efficient Interpolant Generation in Satisfiability Modulo Theories. In Proceedings of TACAS'08, 2008.
20. A. Cimatti and R. Sebastiani. Building Efficient Decision Procedures on top of SAT Solvers. In Formal Methods for Hardware Verification, number 3965 in LNCS. Springer, 2006.
21. K. Claessen, M. Sheeran, N. Een, and N. Sörensson. SAT-solving in practice. In Proceedings of WODES'08, 2008.
22. E. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample Guided Abstraction Refinement. In E. Allen Emerson and A. Prasad Sistla, editors, CAV, volume 1855 of LNCS, pages 154-169. Springer, 2000.
23. S. Cotton and O. Maler. Fast and Flexible Difference Constraint Propagation for DPLL(T). In A. Biere and C. Gomes, editors, SAT, volume 4121 of LNCS, pages 170-183. Springer, 2006.
24. W. Damm and H. Hermanns, editors. Computer Aided Verification, 19th International Conference, CAV 2007, Berlin, Germany, July 3-7, 2007, Proceedings, volume 4590 of LNCS. Springer, 2007.
25. L. de Moura, B. Dutertre, and N. Shankar. A Tutorial on Satisfiability Modulo Theories. In Damm and Hermanns [24], pages 20-36.
26. L. de Moura, H. Rueß, and M. Sorea. Lazy Theorem Proving for Bounded Model Checking over Infinite Domains. In Proc. CADE'02, volume 2392 of LNCS, pages 438-455. Springer, July 2002.
27. 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/teehreports/2003/HPL-2003-148.ps.
28. B. Dutertre and L. de Moura. A Fast Linear-Arithmetic Solver for DPLL(T). In Ball and Jones [6], pages 81-94.
29. J.-C. Filliǎtre, S. Owre, H. Rueß, and N. Shankar. ICS: Integrated Canonizer and Solver. Proc. CAV'2001, 2001.
30. C. Flanagan, R. Joshi, X. Ou, and J. B. Saxe. Theorem Proving Using Lazy Proof Explication. In Proc. CAV 2003, LNCS. Springer, 2003.
31. A. Franzén. Using Satisfiability Modulo Theories for Inductive Verification of Lustre Programs. Electr. Notes Theor. Comput. Sci., 144(1):19-33, 2006.
32. G. Stålmarck and M. Säflund. Modelling and Verifying Systems and Software in Propositional Logic. Ifac SAFECOMP'90, 1990.
33. 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.
34. 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.
35. 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.
36. 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.
37. I. Horrocks. The FaCT System. In H. de Swart, editor, Proc. TABLEAUX-98, volume 1397 of LNAI, pages 307-312. Springer, 1998.
38. R. Jhala and K. McMillan. Array Abstractions from Proofs. In Damm and Hermanns [24], pages 193-206.
39. H. Kautz, D. McAllester, and B. Selman. Encoding Plans in Propositional Logic. In Proc. KR'96, 1996.
40. S.C. Kleene. Mathematical Logic. John Wiley and Sons Inc., 1967.
41. M. Mahfoudh, P. Niebert, E. Asarin, and O. Maler. A Satisfiability Checker for Difference Logic. In Proceedings of SAT-02, pages 222-230, 2002.
42. K. McMillan. Applying SAT Methods in Unbounded Symbolic Model Checking. In Proc. CAV '02, number 2404 in LNCS. Springer, 2002.
43. K. McMillan. Lazy Abstraction with lnterpolants. In Ball and Jones [6], pages 123-136.
44. G. Nelson and D.C. Oppen. Simplification by Cooperating Decision Procedures. ACM Trans. on Programming Languages and Systems, 1(2):245-257, 1979.
45. 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.
46. P. F. Patel-Schneider. DLP System Description. In Proc. DL-98, pages 87-89, 1998.
47. Z. Rakamaric, R. Bruttomesso, A. Hu, and A. Cimatti. Verifying Heap-Manipulating Programs in an SMT Framework. In K. Namjoshi, T. Yoneda, T. Higashino, and Y. Okamura, editors, ATVA, volume 4762 of LNCS, pages 237-252. Springer, 2007.
48. S. Ranise and C. Tinelli. The SMT-LIB Standard. Available at http://combination.cs.uiowa.edu/smtlib/.
49. S. Graf and H. Saidi. Construction of Abstract State Graphs with PVS. In O. Grumberg, editor, Proc. 9th International Conference on Computer Aided Verification (CAV'97), volume 1254 of LNCS, pages 72-83. Springer, 1997.
50. 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.
51. N. Shankar and H. Rueß. Combining Shostak Theories. Invited paper for Floc'02/RTA02, 2002.
52. R. Shostak. A Pratical Decision Procedure for Arithmetic with Function Symbols. Journal of the ACM, 26(2):351-360, 1979.
53. 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.
54. O. Strichman, S. Seshia, and R. Bryant. Deciding separation formulas with SAT. In Proc. of Computer Aided Verification, (CAV'02), LNCS. Springer, 2002.
55. 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.
56. 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.
57. S. Wolfman and D. Weld. The LPSAT Engine & its Application to Resource Planning. In Proc. IJCAI, 1999.
58. 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.