Born in the late 70s, Abstract Interpretation has proven an effective method to construct static
analyzers. It has led to successful program analysis tools routinely used in avionic …

This tutorial provides a programmer's introduction to the Satisfiability Modulo Theories
Solver Z3. It describes how to use Z3 through scripts, provided in the Python scripting …

We introduce a new domain for finding precise numerical invariants of programs by abstract
interpretation. This domain, which consists of level sets of non-linear functions, generalizes …

We present lookahead widening, a novel technique for using existing widening and
narrowing operators to improve the precision of static analysis. This technique is both self …

In static analysis, the semantics of the program is expressed as a set of equations. The
equations are solved iteratively over some abstract domain. If the abstract domain is …

We give a new practical algorithm to compute, in finite time, a fixpoint (and often the least
fixpoint) of a system of equations in the abstract numerical domains of zones and templates …

We present a practical algorithm for computing least solutions of systems of equations over
the integers with addition, multiplication with positive constants, maximum and minimum …

In this article, we introduce a new technique for precision tuning. This problem consists of
finding the least data types for numerical values such that the result of the computation …

Tropical polyhedra have been recently used to represent disjunctive invariants in static
analysis. To handle larger instances, tropical analogues of classical linear programming …

Accelerated fixpoint iteration by means of widening and narrowing is the method of choice
for solving systems of equations over domains with infinite ascending chains. The strict …