Research and development of logic synthesis and verification have matured considerably
over the past two decades. Many commercial products are available, and they have been …

We develop from first principles an exact model of the behavior of loop nests executing in a
memory hicrarchy, by using a nontraditional classification of misses that has the key property …

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

A dataflow-based pointcut is proposed for aspect-oriented programming (AOP) languages.
The pointcut specifies where aspects should be applied based on the origins of values. It is …

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 …

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 …

Reference implementations of signal processing applications are often written in a
sequential language that does not reveal the available parallelism in the application …

Implicit state enumeration for extended finite state machines relies on a decision procedure
for Presburger arithmetic. We compare the performance of two Presburger packages, the …

Symbolic mode, checking has proved highly successful for large finite-state systems, in
which states can be compactly encoded using binary decision diagrams (BDDs) or their …

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