TSAT++: An open platform for satisfiability modulo theories

Electronic Notes in Theoretical Computer Science

Volumn 125, Issue 3, 2005, Pages 25-36

  Armando, Alessandro ^a   Castellini, Claudio ^a   Giunchiglia, Enrico ^a   Idini, Massimo ^a   Maratea, Marco ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

Boolean Satisfiability; Formal Methods; Ground Decision Procedures; Hardware Verification; Separation Logic

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; C (PROGRAMMING LANGUAGE); COMPUTER HARDWARE; INTERFACES (COMPUTER); OPTIMIZATION;

BOOLEAN SATISFIABILITY; FORMAL METHODS; GROUND DECISION PROCEDURES; HARDWARE VERIFICATION; SEPARATION LOGIC;

DECISION THEORY;

EID: 21644476860     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2004.06.065     Document Type: Conference Paper

References (20)

1. A. Armando, and E. Giunchiglia Embedding Complex Decision Procedures inside an Interactive Theorem Prover Annals of Mathematics and Artificial Intelligence 8 3-4 1993 475 502
2. Alessandro Armando, Claudio Castellini, and Enrico Giunchiglia SAT-based procedures for temporal reasoning Susanne Biundo Maria Fox Proceedings of the 5th European Conference on Planning (Durham, UK) Lecture Notes in Computer Science volume 1809 2000 Springer 97 108
3. Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, and Marco Maratea. A sat-based decision procedure for the boolean combination of difference constraints, May 2004. To appear at SAT 2004, Vancouver, BC, Canada
4. Gilles Audemard, Piergiorgio Bertoli, Alessandro Cimatti, Artur Kornilowicz, and Roberto Sebastiani A SAT based approach for solving formulas over boolean and linear mathematical propositions Andrei Voronkov Automated Deduction - CADE-18 Lecture Notes in Computer Science volume 2392 July 27-30 2002 Springer-Verlag 195 210
5. Gilles Audemard, Alessandro Cimatti, Artur Kornilowicz, and Roberto Sebastiani Bounded model checking for timed systems IFIP WG 6.1 International Conference on Formal Techniques for Networked and Distributed Systems (FORTE) LNCS volume 22 2002
6. R.J. Bayardo, Jr. and D. P. Miranker. A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem. In Proc. AAAI, pages 298-304, 1996
7. M. Davis, G. Logemann, and D. Loveland A machine program for theorem proving Journal of the ACM 5 7 1962
8. Leonardo de Moura, Harald Rueß, and Maria Sorea Lazy theorem proving for bounded model checking over infinite domains Lecture Notes in Computer Science 2392 2002 438 455
9. Erich Gamma, Richard Helm, Ralph Johnson, and John Vlissides Design Patterns 1995 Addison Wesley Reading, Mass.
10. Harald Ganzinger, George Hagen, Robert Nieuwenhuis, Albert Oliveras, and Cesare Tinelli. DPLL(T): Fast decision procedures. july 2004. to appear at CAV 2004
11. Enrico Giunchiglia, Marco Maratea, and Armando Tacchella. Look-ahead vs. look-back techniques in a modern sat solver. Accepted at SAT03 - Sixth International Conference on Theory and Applications of Satisfiability Testing, Portofino, Italy, May 2003
12. Shuvendu K. Lahiri, Sanjit A. Seshia, and Randal E. Bryant Modeling and verification of out-of-order microprocessors in UCLID Lecture Notes in Computer Science 2517 2002 142 159
13. A. Oddi and A. Cesta. Incremental forward checking for the disjunctive temporal problem. In Proceedings of the 14th European Conference on Artificial Intelligence (ECAI-2000), pages 108-112, Berlin, 2000
14. Patrick Prosser Hybrid algorithms for the constraint satisfaction problem Computational Intelligence 9 3 1993 268 299
15. Silvio Ranise, and Cesare Tinelli The SMT library (Satisfiability Modulo Theory) http://www.smtlib.org
16. Kostas Stergiou, and Manolis Koubarakis Backtracking algorithms for disjunctions of temporal constraints Artificial Intelligence 120 1 2000 81 117
17. Ofer Strichman, Sanjit A. Seshia, and Randal E. Bryant Deciding separation formulas with SAT Lecture Notes in Computer Science 2404 2002 209 222
18. Aaron Stump, Clark W. Barrett, and David L. Dill. CVC: a cooperating validity checker. In J.C. Godskesen, editor, Proceedings of the International Conference on Computer-Aided Verification, Lecture Notes in Computer Science, 2002
19. Ioannis Tsamardinos and Martha Pollack. Efficient solution techniques for disjunctive temporal reasoning problems. Artificial Intelligence, 2003. To appear
20. Steven Wolfman and Daniel Weld. The LPSAT-engine & its application to resource planning. In Proc. IJCAI-99, 1999