We present the first verification of full functional correctness for a range of linked data
structure implementations, including mutable lists, trees, graphs, and hash tables …

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

This paper presents our integration of efficient resolution-based theorem provers into the
Jahob data structure verification system. Our experimental results show that this approach …

We propose natural proofs for reasoning with programs that manipulate data-structures
against specifications that describe the structure of the heap, the data stored within it, and …

We consider the problem of automated reasoning about dynamically manipulated data
structures. Essential properties are encoded as predicates whose definitions are formalized …

We develop logical mechanisms and procedures to facilitate the verification of full functional
properties of inductive tree data-structures using recursion that are sound, incomplete, but …

We present a new approach for constructing and verifying higher-order, imperative
programs using the Coq proof assistant. We build on the past work on the Ynot system …

This paper describes CFML, the first program verification tool based on characteristic
formulae. Given the source code of a pure Caml program, this tool generates a logical …

We present a new technique for verifying commutativity conditions, which are logical
formulas that characterize when operations commute. Because our technique reasons with …

We introduce a lightweight approach for reasoning about programs involving imperative
data structures using the proof assistant Isabelle/HOL. It is based on shallow embedding of …