Program analysis concerns static techniques for computing reliable approximate information
about the dynamic behaviour of programs. Applications include compilers (for code …

The field of program analysis has focused primarily on sequential programming languages.
But multithreading is becoming increasingly important, both as a program structuring …

Shape analysis concerns the problem of determining" shape invariants" for programs that
perform destructive updating on dynamically allocated storage. This article presents a …

Modern software systems, which often are concurrent and manipulate complex data
structures must be extremely reliable. We present a novel framework based on symbolic …

This paper presents Korat, a novel framework for automated testing of Java programs. Given
a formal specification for a method, Korat uses the method precondition to automatically …

During the past twenty-one years, over seventy-five papers and nine Ph. D. theses have
been published on pointer analysis. Given the tomes of work on this topic one may …

We show how model checking and symbolic execution can be used to generate test inputs
to achieve structural coverage of code that manipulates complex data structures. We focus …

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 presents a new static type system for multithreaded programs; well-typed
programs in our system are guaranteed to be free of data races and deadlocks. Our type …

Irregular applications, which manipulate large, pointer-based data structures like graphs, are
difficult to parallelize manually. Automatic tools and techniques such as restructuring …