Article thumbnail
Location of Repository

Modular verification of a non-blocking stack.

By Richard Bornat, Matthew Parkinson and Peter O'Hearn

Abstract

This paper contains a model and a proof of soundness for a range of program logics based on separation logic and including the notions of permission and ownership for stack variables. It shows that there is no loss of expressive power (all proofs in Hoare logic are expressible). This permits the construction of program-reasoning tools that use the notion of ‘variables as resource'. This is a highly technical piece of work, and its impact will emerge when more tools have been constructed. Variables-as-resource will be necessary if such tools are to emerge.

Publisher: ACM New York, USA
Year: 2007
OAI identifier: oai:eprints.mdx.ac.uk:35
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://portal.acm.org/citation... (external link)
  • http://www.mdx.ac.uk/about-us/... (external link)
  • http://doi.org/10.1145/1190216... (external link)
  • Suggested articles


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