DMCA
Full functional verification of linked data structures (2008)
Cached
Download Links
| Venue: | In ACM Conf. Programming Language Design and Implementation (PLDI |
| Citations: | 101 - 19 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}
}
Share
 |
 |
 |
 |
||
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,
Keyphrases
data structure full functional verification jahob verification system diverse collection classical higher-order logic lambda abstraction first verification intractable construct mutable list generated verification condition transitive closure formal specification verification condition specialized decision procedure java data structure implementation memory consumption simpler subformulas data structure implementation full functional correctness execution time desired behavior hash table desired correctness property
