Solvers for satisfiability modulo theories (SMT) check the satisfiability of first-order formulas
containing operations from various theories such as the Booleans, bit-vectors, arithmetic …

We present a new Simplex-based linear arithmetic solver that can be integrated efficiently in
the DPLL (T) framework. The new solver improves over existing approaches by enabling fast …

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 …

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 …

Automated deduction uses computation to perform symbolic logical reasoning. It has been a
core technology for program verification from the very beginning. Satisfiability solvers for …

Abstract The annual Satisfiability Modulo Theories Competition (SMT-COMP) was initiated
in 2005 in order to stimulate the advance of state-of-the-art techniques and tools developed …

Predictive analysis aims at detecting concurrency errors during runtime by monitoring a
concrete execution trace of a concurrent program. In recent years, various models based on …

SAT-based Bounded Model Checking (BMC) has been found promising in finding deep
bugs in industry designs and scaling well with design sizes. However, it has limitations due …

We present a new Simplex-based linear arithmetic solver that can be integrated efficiently in
the DPLL (T) framework. The new solver improves over existing approaches by enabling fast …

ProB provides a constraint solver for the B-method written in Prolog and can make use of
different backends based on SAT and SMT solving. One such backend translates B and …