Structured Specifications for Better Verification of Heap-Manipulating Programs

Abstract

Conventional specifications typically have a flat structure that is based primarily on the underlying logic. Such specifications lack structures that could have provided better guidance to the verification process. In this work, we propose to add three new structures to a specification framework for separation logic to achieve a more precise and better guided verification for pointer-based programs. The newly introduced structures empower users with more control over the verification process in the following ways: (i) case analysis can be invoked to take advantage of disjointness conditions in the logic. (ii) early, as opposed to late, instantiation can minimise on the use of existential quantification. (iii) formulae that are staged provide better reuse of the verification process. Initial experiments have shown that structured specifications can lead to more precise verification without incurring any performance overhead.

DOI: 10.1007/978-3-642-21437-0_29

Extracted Key Phrases

3 Figures and Tables

Cite this paper

@inproceedings{Gherghina2011StructuredSF, title={Structured Specifications for Better Verification of Heap-Manipulating Programs}, author={Cristian Gherghina and Cristina David and Shengchao Qin and Wei-Ngan Chin}, booktitle={FM}, year={2011} }