## Full functional verification of linked data structures (2008)

### Cached

### Download Links

- [lara.epfl.ch]
- [www.mit.edu]
- [www.mit.edu]
- [www.cag.csail.mit.edu]
- [www.cag.lcs.mit.edu]
- [cag.csail.mit.edu]
- [people.csail.mit.edu]
- [people.csail.mit.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | In ACM Conf. Programming Language Design and Implementation (PLDI |

Citations: | 79 - 17 self |

### BibTeX

@INPROCEEDINGS{Zee08fullfunctional,

author = {Karen Zee and Viktor Kuncak and Martin C. Rinard},

title = {Full functional verification of linked data structures},

booktitle = {In ACM Conf. Programming Language Design and Implementation (PLDI},

year = {2008}

}

### OpenURL

### Abstract

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. Specifically, we present the use of the Jahob verification system to verify formal specifications, written in classical higher-order logic, that completely capture the desired behavior of the Java data structure implementations (with the exception of properties involving execution time and/or memory consumption). Given that the desired correctness properties include intractable constructs such as quantifiers, transitive closure, and lambda abstraction, it is a challenge to successfully prove the generated verification conditions. Our Jahob verification system uses integrated reasoning to split each verification condition into a conjunction of simpler subformulas, then apply a diverse collection of specialized decision procedures,