Index Terms
Satisfiability modulo theories for high integrity development
Recommendations
A tutorial on satisfiability modulo theories
CAV'07: Proceedings of the 19th international conference on Computer aided verificationSolvers for satisfiability modulo theories (SMT) check the satisfiability of first-order formulas containing operations from various theories such as the Booleans, bit-vectors, arithmetic, arrays, and recursive datatypes. SMT solvers are extensions of ...
Local Search For Satisfiability Modulo Integer Arithmetic Theories
Satisfiability Modulo Theories (SMT) refers to the problem of deciding the satisfiability of a formula with respect to certain background first-order theories. In this article, we focus on Satisfiablity Modulo Integer Arithmetic, which is referred to as ...
A progressive simplifier for satisfiability modulo theories
SAT'06: Proceedings of the 9th international conference on Theory and Applications of Satisfiability TestingIn this paper we present a new progressive cooperating simplifier for deciding the satisfiability of a quantifier-free formula in the first-order theory of integers involving combinations of sublogics, referred to as Satisfiability Modulo Theories (SMT)...







Comments