Finding and exploiting vulnerabilities in binary code is a challenging task. The lack of high-
level, semantically rich information about data structures and control constructs makes the …

Propositional Satisfiability (SAT) and Constraint Programming (CP) have developed as two
relatively independent threads of research cross-fertilizing occasionally. These two …

The SMT-LIB initiative is an international effort, supported by several research groups
worldwide, with the two-fold goal of producing an extensive on-line library of benchmarks …

We first introduce Abstract DPLL, a rule-based formulation of the Davis--Putnam--Logemann-
-Loveland (DPLL) procedure for propositional satisfiability. This abstract framework allows …

This paper describes the First-Order Form (FOF) and Clause Normal Form (CNF) parts of the
TPTP problem library, and the associated infrastructure. TPTP v3. 5.0 was the last release …

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 …

Craig interpolation is an active research topic and has become a powerful technique in
verification. We present SMTInterpol, an interpolating SMT solver for the quantifier-free …

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 …

In recent years, Satisfiability Modulo Theory (SMT) solvers are becoming increasingly
popular in the Computer Aided Verification and Reasoning community. Used natively or as …

Abstract Solvers for SAT Modulo Theories (SMT) can nowadays handle large industrial (eg,
formal hardware and software verification) problems over theories such as the integers …