Show simple item record

dc.contributor.advisorMartin Rinard
dc.contributor.authorBouillaguet, Charles
dc.contributor.authorKuncak, Viktor
dc.contributor.authorWies, Thomas
dc.contributor.authorZee, Karen
dc.contributor.authorRinard, Martin
dc.contributor.otherComputer Architecture
dc.date.accessioned2006-11-09T15:26:55Z
dc.date.available2006-11-09T15:26:55Z
dc.date.issued2006-11-09
dc.identifier.otherMIT-CSAIL-TR-2006-072
dc.identifier.urihttp://hdl.handle.net/1721.1/34874
dc.description.abstractThis paper presents our integration of efficient resolution-based theorem provers into the Jahob data structure verification system. Our experimental results show that this approach enables Jahob to automatically verify the correctness of a range of complex dynamically instantiable data structures, including data structures such as hash tables and search trees, without the need for interactive theorem proving or techniques tailored to individual data structures. Our primary technical results include: (1) a translation from higher-order logic to first-order logic that enables the application of resolution-based theorem provers and (2) a proof that eliminating type (sort) information in formulas is both sound and complete, even in the presence of a generic equality operator. Our experimental results show that the elimination of type information dramatically decreases the time required to prove the resulting formulas. These techniques enabled us to verify complex correctness properties of Java programs such as a mutable set implemented as an imperative linked list, a finite map implemented as a functional ordered tree, a hash table with a mutable array, and a simple library system example that uses these container data structures. Our system verifies (in a matter of minutes) that data structure operations correctly update the finite map, that they preserve data structure invariants (such as ordering of elements, membership in appropriate hash table buckets, or relationships between sets and relations), and that there are no run-time errors such as null dereferences or array out of bounds accesses.
dc.format.extent32 p.
dc.format.extent397902 bytes
dc.format.extent1759318 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_US
dc.relation.ispartofseriesMassachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory
dc.subjectprogram verification
dc.subjectshape analysis
dc.subjectmultisorted logic
dc.titleOn Using First-Order Theorem Provers in the Jahob Data Structure Verification System
dc.identifier.citationShort version to appear in VMCAI'07, Nice, January 2007


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record