Software engineers are faced with a dilemma. They want to write general and wellstructured
programs that are flexible and easy to maintain. On the other hand, generality has a price …

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 …

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 …

We describe a framework for adding type qualifiers to a language. Type qualifiers encode a
simple but highly useful form of subtyping. Our framework extends standard type rules to …

This paper reports on the design and implementation of a practical shape analysis for C. The
purpose of the analysis is to aid in the disambiguation of heap-allocated data structures by …

We present a new framework for verifying partial specifications of programs in order to catch
type and memory errors and check data structure invariants. Our technique can verify a large …

Despite their popularity and importance, pointer-based programs remain a major challenge
for program verification. In recent years, separation logic has emerged as a contender for …

Ownership types provide a statically enforceable way of specifying object encapsulation and
enable local reasoning about program correctness in object-oriented languages. However …

Synthesis of program fragments from specifications can make programs easier to write and
easier to reason about. To integrate synthesis into programming languages, synthesis …

The major reason for the lack of use'of parallel'computing, is the mismatch between the
complexity and variety of parallel hardware, and the software development tools to program …