Data Structure Specifications via Local Equality Axioms

  • Scott McPeak
  • George C. Necula
Conference paper

DOI: 10.1007/11513988_47

Volume 3576 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
McPeak S., Necula G.C. (2005) Data Structure Specifications via Local Equality Axioms. In: Etessami K., Rajamani S.K. (eds) Computer Aided Verification. CAV 2005. Lecture Notes in Computer Science, vol 3576. Springer, Berlin, Heidelberg

Abstract

We describe a program verification methodology for specifying global shape properties of data structures by means of axioms involving predicates on scalar fields, pointer equalities, and pointer disequalities, in the neighborhood of a memory cell. We show that such local invariants are both natural and sufficient for describing a large class of data structures. We describe a complete decision procedure for axioms without disequalities, and practical heuristics for the full language. The procedure has the key advantage that it can be extended easily with reasoning for any decidable theory of scalar fields.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Scott McPeak
    • 1
  • George C. Necula
    • 1
  1. 1.University of CaliforniaBerkeley