Heap data is potentially unbounded and seemingly arbitrary. Hence, unlike stack and static
data, heap data cannot be abstracted in terms of a fixed set of program variables. This …

This paper describes an inter-procedural technique for computing symbolic bounds on the
number of statements a procedure executes in terms of its scalar inputs and user-defined …

Array bound checking and array dependency analysis (for parallelization) have been widely
studied. However, there are much less results about analyzing properties of array contents …

We introduce streaming data string transducers that map input data strings to output data
strings in a single left-to-right pass in linear time. Data strings are (unbounded) sequences of …

Proving program termination Page 1 88 CommunICatIons of the aCm | MAy 2011 | vOl. 54 |
nO. 5 review articles Il lu S T r a T Io n B y M a T T H e W C o o P e r the ProGraM …

It is important to prove that supposedly terminating programs actually terminate, particularly
if those programs must be run on critical systems or downloaded into a client such as a …

We want to estimate the pose of human heads. This estimation involves a nonlinear
map** from the input image to an output parametric description. We characterize the …

One-counter automata are a fundamental and widely-studied class of infinite-state systems.
In this paper we consider one-counter automata with counter updates encoded in binary …

We present a logic for relating heap-manipulating programs to numeric abstractions. These
numeric abstractions are expressed as simple imperative programs over integer variables …

This paper presents a publicly available toolkit and a benchmark suite for rigorous
verification of Integer Numerical Transition Systems (INTS), which can be viewed as control …