Abstract Satisfiability Modulo Theories (SMT) refers to the problem of determining whether a
first-order formula is satisfiable with respect to some logical theory. Solvers based on SMT …

Abstract 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 …

Abstract 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 …

Applications in artificial intelligence, formal verification, and other areas have greatly
benefited from the recent advances in SAT. It is often the case, however, that applications in …

Traditional methods for combining theory solvers rely on capabilities of the solvers to
produce all implied equalities or a pre-processing step that introduces additional literals into …

The problem of computing Craig Interpolants for propositional (SAT) formulas has recently
received a lot of interest, mainly for its applications in formal verification. However …

Deciding satisfiability in the theory of arrays, particularly in combination with bit-vectors, is
essential for software and hardware verification. We precisely describe how the lemmas on …

Automated software verification has made great progress recently, and a key enabler of this
progress has been the advances in efficient, automated decision procedures suitable for …

Most state-of-the-art approaches for Satisfiability Modulo Theories (SMT(T)) rely on the
integration between a SAT solver and a decision procedure for sets of literals in the …

Abstract Satisfiability Modulo Theories (SMT(T)) is the problem of deciding the satisfiability of
a formula with respect to a given background theory T. When T is the combination of two …