Skip to main content
Article thumbnail
Location of Repository

A semantic basis for local reasoning

By Hongseok Yang and Ropas Kaist Queen Mary

Abstract

Abstract. 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. 1 Introduction The need to say what memory cells or other resources are not changed, along with those that are, has always been a vexing problem in program specification

Publisher: Springer
Year: 2002
OAI identifier: oai:CiteSeerX.psu:10.1.1.133.9812
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.di.unipi.it/~ghelli... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.