Program analysis and verification require decision procedures to reason on theories of data
structures. Many problems can be reduced to the satisfiability of sets of ground literals in …

The problem of deciding the satisfiability of a quantifier-free formula with respect to a
background theory, also known as Satisfiability Modulo Theories (SMT), is gaining …

Many approaches to deciding the satisfiability of quantifier-free formulae with respect to a
background theory T—also known as Satisfiability Modulo Theory, or SMT (T)—rely on the …

In the context of combinations of theories with disjoint signatures, we classify the component
theories according to the decidability of constraint satisfiability problems in arbitrary and in …

We present a generic congruence closure algorithm for deciding ground formulas in the
combination of the theory of equality with uninterpreted symbols and an arbitrary built-in …

The use of interpolants in model checking is becoming an enabling technology to allow fast
and robust verification of hardware and software. The application of encodings based on the …

In this thesis, we propose new automation capabilities for the Coq proof assistant. We obtain
this mechanization via an integration into Coq of decision procedures for propositional logic …

First-order logic has a long tradition and is one of the most prominent and most important
formalisms in computer science and mathematics. It is well-known that the satisfiability …

We study how to efficiently combine satisfiability procedures built by using a superposition
calculus with satisfiability procedures for theories, for which the superposition calculus may …

Verification problems can often be encoded as first-order validity or satisfiability problems.
The availability of efficient automated theorem provers is a crucial pre-requisite for …