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 …

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 …

The problem of computing Craig interpolants has recently received a lot of interest. In this
article, we address the problem of efficient generation of interpolants for some important …

The inference of program invariants over machine arithmetic, commonly called bit-vector
arithmetic, is an important problem in verification. Techniques that have been successful for …

We present an interpolation procedure for the theory of fixed-size bit-vectors, which allows to
apply effective interpolation-based techniques for software verification without giving up the …

Existing techniques for Craig interpolation for the quantifier-free fragment of the theory of
arrays are inefficient for computing sequence and tree interpolants: the solver needs to run …

Craig interpolation in SMT is difficult because, eg, theory combination and integer cuts
introduce mixed literals, ie, literals containing local symbols from both input formulae. In this …

The use of interpolants in verification is gaining more and more importance. Since theories
used in applications are usually obtained as (disjoint) combinations of simpler theories, it is …

Craig interpolation has emerged as an effective means of generating candidate program
invariants. We present interpolation procedures for the theories of Presburger arithmetic …

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 …