Combining theorem proving with static analysis for data structure consistency (2004)
Cached
Download Links
| Venue: | In International Workshop on Software Verification and Validation (SVV 2004 |
| Citations: | 21 - 15 self |
BibTeX
@INPROCEEDINGS{Zee04combiningtheorem,
author = {Karen Zee and Patrick Lam and Viktor Kuncak and Martin Rinard},
title = {Combining theorem proving with static analysis for data structure consistency},
booktitle = {In International Workshop on Software Verification and Validation (SVV 2004},
year = {2004}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract We describe an approach for combining theorem proving techniques with static analysis to analyze data structure consistency for programs that manipulate heterogeneous data structures. Our system uses interactive theorem proving and shape analysis to verify that data structure implementations conform to set interfaces. A simpler static analysis then uses the verified set interfaces to verify properties that characterize how shared objects participate in multiple data structures. We have successfully applied this technique to several programs and found that theorem proving within circumscribed regions of the program combined with static analysis enables the verification of large-scale program properties.
