Configurable software verification is a recent concept for expressing different program
analysis and model checking approaches in one single formalism. This paper presents …

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 …

In recent years, bit-precise reasoning has gained importance in hardware and software
verification. Of renewed interest is the use of symbolic reasoning for synthesising loop …

We present a new method for the constraint-based synthesis of termination arguments for
linear loop programs based on linear ranking templates. Linear ranking templates are …

We present a novel approach to termination analysis. In a first step, the analysis uses a
program as a black-box which exhibits only a finite set of sample traces. Each sample trace …

In this article, we study the complexity of the problems: given a loop, described by linear
constraints over a finite set of variables, is there a linear or lexicographical-linear ranking …

We present a novel approach to solve quantified boolean formulas with one quantifier
alternation (2QBF). The algorithm incrementally adds new constraints to the formula until the …

Modern termination provers rely on a safety checker to construct disjunctively well-founded
transition invariants. This safety check is known to be the bottleneck of the procedure. We …

Multiphase ranking functions (M\varPhi RFs) were proposed as a means to prove the
termination of a loop in which the computation progresses through a number of “phases” …

In this paper we study the complexity of the Linear Ranking problem: given a loop, described
by linear constraints over a finite set of integer variables, is there a linear ranking function for …