TSAT++: an Open Platform for Satisfiability Modulo Theories

Authors:
Alessandro Armando;Claudio Castellini;Enrico Giunchiglia;Massimo Idini;Marco Maratea
Affiliations:
MRG-DIST, University of Genova, Genova, Italy;MRG-DIST, University of Genova, Genova, Italy;MRG-DIST, University of Genova, Genova, Italy;MRG-DIST, University of Genova, Genova, Italy;MRG-DIST, University of Genova, Genova, Italy
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 11
Cited 2

Backtracking algorithms for disjunctions of temporal constraints

Artificial Intelligence
Modeling and Verification of Out-of-Order Microprocessors in UCLID

FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
CVC: A Cooperating Validity Checker

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Deciding Separation Formulas with SAT

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
SAT-Based Procedures for Temporal Reasoning

ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Efficient solution techniques for disjunctive temporal reasoning problems

Artificial Intelligence
The LPSAT engine & its application to resource planning

IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
A SAT-based decision procedure for the boolean combination of difference constraints

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing

The SAT-based Approach to Separation Logic

Journal of Automated Reasoning
Solving disjunctive temporal problems with preferences using maximum satisfiability

AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes TSAT++, an open platform which realizes the lazy SAT-based approach to Satisfiability Modulo Theories (SMT). SMT is the problem of determining satisfiability of a propositional combination of T-literals, where T is a first-order theory for which a satisfiability procedure for a set of ground atoms is known. TSAT++ enjoys a modular design in which an enumerator and a theory-specific satisfiability checker cooperate in order to solve SMT. Modularity allows both different enumerators, and satisfiability checkers for different theories (or combinations of theories), to be plugged in, as far as they comply to a simple and well-defined interface. A number of optimization techniques are also implemented in TSAT++, which are independent of the modules used (and of the corresponding theory). Some experimental results are presented, showing that TSAT++, instantiated for Separation Logic, is competitive with, or faster than, state-of-the-art solvers for that very logic.