The top-down solver (TD) is a local fixpoint algorithm for arbitrary equation systems. It
considers the right-hand sides as black boxes and detects dependencies between …

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 …

We introduce FPSOLVE, an implementation of generic algorithms for solving fixpoint
equations over semirings. We first illustrate the interest of generic solvers by means of a …

Resource constrained shortest path problems are usually solved thanks to a smart
enumeration of all the non-dominated paths. Recent improvements of these enumeration …

Context-sensitive analysis of programs containing recursive procedures may be expensive,
in particular, when using expressive domains, rendering the set of possible contexts large or …

Program analysis by abstract interpretation using relational abstract domains—like
polyhedra or octagons—easily extends from state analysis (construction of reachable states) …

We show how to generate a constraint system of symbolic expressions as part of an inter-
procedural constraint-system–based program analysis such that any chosen slice of the …

We present an algorithm for the removal of constraints (resp., generators) from a convex
polyhedron represented in the Double Description framework. Instead of recomputing the …

We present an enhancement of the generic fixpoint algorithm TD which can deal with
widening and narrowing even for non-monotonic systems of equations. In contrast to …

Precise dynamic race detectors report an error if and only if more than one thread
concurrently exhibits conflict on a memory access. They insert instrumentations at compile …