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 …

veriT: An Open, Trustable and Efficient SMT-Solver Page 1 veriT: An Open, Trustable and
Efficient SMT-Solver Thomas Bouton2, Diego Caminha B. de Oliveira2, David Déharbe1 …

The theory of arrays is ubiquitous in the context of software and hardware verification and
symbolic analysis. The basic array theory was introduced by McCarthy and allows to …

Although different satisfiability decision procedures can be combined by algorithms such as
those of Nelson–Oppen or Shostak, current tools typically can only support a finite number of …

Many applications of automated deduction require reasoning in first-order logic modulo
background theories, in particular some form of integer arithmetic. A major unsolved …

The hierarchical superposition based theorem proving calculus of Bachmair, Ganzinger, and
Waldmann enables the hierarchic combination of a theory with full first-order logic. If a …

Symbolic analysis techniques have largely improved over the years, and are now
approaching an industrial maturity level. One of the main limitations to the scalability of …

Applications in software verification often require determining the satisfiability of first-order
formulae with respect to background theories. During development, conjectures are usually …

Abstract Satisfiability Modulo Theories (SMT) solvers have proven highly scalable, efficient
and suitable for integrated theory reasoning. The most efficient SMT solvers rely on …