Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
12,678
Lazy Satisfiability Modulo Theories
- JOURNAL ON SATISFIABILITY, BOOLEAN MODELING AND COMPUTATION 3 (2007) 141Â224
, 2007
"... Satisfiability Modulo Theories (SMT) is the problem of deciding the satisfiability of a first-order formula with respect to some decidable first-order theory T (SMT (T)). These problems are typically not handled adequately by standard automated theorem provers. SMT is being recognized as increasingl ..."
Abstract
-
Cited by 189 (50 self)
- Add to MetaCart
Satisfiability Modulo Theories (SMT) is the problem of deciding the satisfiability of a first-order formula with respect to some decidable first-order theory T (SMT (T)). These problems are typically not handled adequately by standard automated theorem provers. SMT is being recognized
Proofs in Satisfiability Modulo Theories
"... Satisfiability Modulo Theories (SMT) solvers4 check the satisfiability of first-order formulas written in a language containing interpreted predicates and func-tions. These interpreted symbols are defined either by first-order axioms (e.g. the axioms of equality, or array axioms for operators read a ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
Satisfiability Modulo Theories (SMT) solvers4 check the satisfiability of first-order formulas written in a language containing interpreted predicates and func-tions. These interpreted symbols are defined either by first-order axioms (e.g. the axioms of equality, or array axioms for operators read
Challenges in Satisfiability Modulo Theories
- In (TRA2007
, 2007
"... Abstract. Here we give a short overview of the DPLL(T) approach to Satisfiability Modulo Theories (SMT), which is at the basis of current state-of-the-art SMT systems. After that, we provide a documented list of theoretical and practical current challenges related to SMT, including some new ideas to ..."
Abstract
-
Cited by 11 (0 self)
- Add to MetaCart
Abstract. Here we give a short overview of the DPLL(T) approach to Satisfiability Modulo Theories (SMT), which is at the basis of current state-of-the-art SMT systems. After that, we provide a documented list of theoretical and practical current challenges related to SMT, including some new ideas
Satisfiability Modulo Theories: An Appetizer
"... Satisfiability Modulo Theories (SMT) is about checking the satisfiability of logical formulas over one or more theories. The problem draws on a combination of some of the most fundamental areas in computer science. It combines the problem of Boolean satisfiability with domains, such as, those studie ..."
Abstract
-
Cited by 12 (0 self)
- Add to MetaCart
Satisfiability Modulo Theories (SMT) is about checking the satisfiability of logical formulas over one or more theories. The problem draws on a combination of some of the most fundamental areas in computer science. It combines the problem of Boolean satisfiability with domains, such as, those
Satisfiability Modulo Theories
"... We present a general framework, DPLL(T ), for integrating decision procedures into the DPLL method. While its main motivation is producing fast solvers for the satisfiability of ground formulas in first-order theories with decidable ground consequences, the framework is also useful in the propositio ..."
Abstract
-
Cited by 17 (2 self)
- Add to MetaCart
in the propositional case. SAT problems can often be converted into satisfiability problems modulo a theory T for which faster SAT methods than DPLL are known. We show how one can use DPLL(T ) to take advantage of this fact and achieve better performance.
Applications and challenges in satisfiability modulo theories
- In Workshop on Invariant Generation (WING
, 2011
"... The area of software analysis, testing and verification is now undergoing a revolution thanks to the use of automated and scalable support for logical methods. A well-recognized premise is that at the core of software analysis engines is invariably a component using logical formulas for describing s ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
. In particular, theorem provers that directly support common software constructs offer a compelling basis. Such provers are commonly called satisfiability modulo theories (SMT) solvers. Z3 is the leading SMT solver. It is developed by the authors at Microsoft Research. It can be used to check the satisfiability
Program verification as satisfiability modulo theories
"... A key driver of SMT over the past decade has been an interchange format, SMT-LIB, and a growing set of benchmarks sharing this common format. SMT-LIB captures very well an interface that is suitable for many tasks that reduce to solving first-order formulas modulo theories. Here we propose to extend ..."
Abstract
-
Cited by 23 (4 self)
- Add to MetaCart
A key driver of SMT over the past decade has been an interchange format, SMT-LIB, and a growing set of benchmarks sharing this common format. SMT-LIB captures very well an interface that is suitable for many tasks that reduce to solving first-order formulas modulo theories. Here we propose
SMT-COMP: Satisfiability Modulo Theories Competition
- In Proceedings of the 17th International Conference on Computer Aided Verification (CAV-2005
, 2005
"... Decision procedures for checking satisfiability of logical formulas are crucial for many verification applications (e.g., [2, 6, 3]). Of particular recent interest are solvers for Satisfiability Modulo Theories (SMT). SMT solvers decide log-ical satisfiability (or dually, validity) with respect to a ..."
Abstract
-
Cited by 45 (4 self)
- Add to MetaCart
Decision procedures for checking satisfiability of logical formulas are crucial for many verification applications (e.g., [2, 6, 3]). Of particular recent interest are solvers for Satisfiability Modulo Theories (SMT). SMT solvers decide log-ical satisfiability (or dually, validity) with respect
Results 1 - 10
of
12,678
