The integer primitive type has upper and lower bounds in many programming languages,
including C, and Java. These limits might lead programs that manipulate large integer …

Induction is a successful approach for verification of hardware and software systems. A
common practice is to model a system using logical formulas, and then use a decision …

The precision of an analysis based on abstract interpretation does not only depend on the
abstract domain, but also on the solving method. The traditional solution is to solve …

The most commonly used integer types have fixed bit-width, making it possible for
computations to “wrap around,” and many programs depend on this behaviour. Yet much …

We present practical algorithms for computing exact least solutions of equation systems over
the reals with addition, multiplication by positive constants, minimum and maximum. The …

In top-down enumeration for program synthesis, abstraction-based pruning uses an abstract
domain to approximate the set of possible values that a partial program, when completed …

Formal verification of infinite-state systems, and distributed systems in particular, is a long
standing research goal. In the deductive verification approach, the programmer provides …

Techniques to evaluate a program's cache performance fall into two camps: 1. Traditional
trace-based cache simulators precisely account for sophisticated real-world cache models …

Static analysis is often performed on source code where intervals--possibly the most widely
used numeric abstract domain--have successfully been used as a program abstraction for …

Data-flow analyses usually associate information with control flow regions. Informally, if
these regions are too small, like a point between two consecutive statements, we call the …