In compiler research, polytopes and related mathematical objects have been successfully
used for several decades to represent and manipulate computer programs in an approach …

We present a new symbolic model checker which conservatively evaluates safety and
liveness properties on infinite-state programs. We use Presburger formulas to symbolically …

Model checking is a powerful technique for analyzing large, finite-state systems. In an infinite
state system, however, many basic properties are undecidable. In this article, we present a …

In this paper we introduce the notion of a P automaton with one-way communication, a
concept related both to Psystems and the traditional concept of automata. AP automaton …

Fast acceleration of symbolic transition systems (F ast) is a tool for the analysis of systems
manipulating unbounded integer variables. We check safety properties by computing the …

Designers often apply manual or semi-automatic loop and data transformations on array-
and loop-intensive programs to improve performance. It is crucial that such transformations …

Modular static analyzers use procedure abstractions, aka summarizations, to ensure that
their execution time increases linearly with the size of analyzed programs. A similar …

Many program optimizations and analyses, such as array-bounds checking, termination
analysis, etc., depend on knowing the size of a function's input and output. However, size …

Programming resource-sensitive systems, such as real-time embedded systems, requires
guaranteeing both the functional correctness of computations and also that time and space …

Program slicing is an analysis that answers questions such as “Which statements might
affect the computation of vari-able 11 at stat. ement s?” or “Which statements depend on the …