This paper shows how to achieve, under certain conditions, abstract-interpretation
algorithms that enjoy the best possible precision for a given abstraction. The key idea is a …

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

We present an overview of the Jahob system for modular analysis of data structure
properties. Jahob uses a subset of Java as the implementation language and annotations …

Many software model checkers are based on predicate abstraction. If the verification goal
depends on pointer structures, the approach does not work well, because it is difficult to find …

This paper addresses the verification of properties of imperative programs with recursive
procedure calls, heap-allocated storage, and destructive updating of pointer-valued fields …

This dissertation describes an approach for automatically verifying data structures, focusing
on techniques for automatically proving formulas that arise in such verification. I have …

We show that the idea of predicates on heap objects can be cast in the framework of
predicate abstraction. This leads to an alternative view on the underlying concepts of three …

This paper reports on the automated verification of the total correctness (partial correctness
and termination) of the Deutsch-Schorr-Waite (DSW) algorithm. DSW is an algorithm for …

This paper presents a methodology for automated modular verification of C programs
against specifications written in separation logic. The distinguishing features of the approach …

We present an abstraction refinement technique for the verification of universally quantified
array assertions such as “all elements in the array are sorted”. Our technique can be …