Permission accounting in separation logic.

Bornat, Richard and Calcagno, Cristiano and Parkinson, Matthew and O'Hearn, Peter (2005) Permission accounting in separation logic. 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '05), Long Beach, California, USA. Proceedings . pp. 259-270. ISSN 0362-1340

Full text is not in this repository.

This item is available in: Library Catalogue

Abstract

Concurrent separation logic includes the notion of ‘ownership' of a heap data structure that can be transferred between processes. This paper refined that idea with permission – partial ownership – so that we could deal with shared read-only data. It applies that idea to two significant examples – readers-and-writers, in particular, had never before had a simple formal proof – and shows why at least two forms of permission are required.
Separation logic has become a major influence on work in concurrency and in program analysis. Permissions are now routinely used in that work.

Item Type: Article
Research Areas: A. > School of Science and Technology > Computer Science
A. > School of Science and Technology > Computer Science > Foundations of Computing group
ISI Impact: 4
Item ID: 32
Useful Links:
Depositing User: Repository team
Date Deposited: 13 Oct 2008 15:59
Last Modified: 07 Dec 2015 16:18
URI: http://eprints.mdx.ac.uk/id/eprint/32

Actions (login required)

Edit Item Edit Item