We present a semantic analysis of a recently proposed formalism for local reasoning, where a specification (and hence proof) can concentrate on only those cells that a program accesses. Our main results are the soundness and, in a sense, completeness of a rule that allows frame axioms, which describe invariant properties of portions of heap memory, to be inferred automatically; thus, these axioms can be avoided when writing specifications.
CITATION STYLE
Yang, H., & O’Hearn, P. (2002). A semantic basis for local reasoning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2303, pp. 402–416). Springer Verlag. https://doi.org/10.1007/3-540-45931-6_28
Mendeley helps you to discover research relevant for your work.