A decision procedure is an algorithm that, given a decision problem, terminates with a
correct yes/no answer. In this book, we focus on decision procedures for decidable first …

Most specification languages express only qualitative constraints. However, among two
implementations that satisfy a given specification, one may be preferred to another. For …

A central objective of the verifying compiler grand challenge is to develop a push-button
verifier that generates proofs of correctness in a syntax-driven fashion similar to the way an …

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 …

We prove several results related to local proofs, interpolation and superposition calculus
and discuss their use in predicate abstraction and invariant generation. Our proofs and …

Deciding satisfiability in the theory of arrays, particularly in combination with bit-vectors, is
essential for software and hardware verification. We precisely describe how the lemmas on …

We introduce a new decidable logic for reasoning about infinite arrays of integers. The logic
is in the ∃^*∀^* first-order fragment and allows (1) Presburger constraints on existentially …

Automatic verification of programs manipulating arrays relies on specialised decision
procedures. A methodology to classify the theories handled by these procedures is …

We present a new angle on solving quantified linear integer arithmetic based on combining
the automata-based approach, where numbers are understood as bitvectors, with ideas from …

We provide a verification technique for a class of programs working on integer arrays of
finite, but not a priori bounded length. We use the logic of integer arrays SIL [13] to specify …