Permission accounting in separation logic.

Bornat, Richard ORCID: https://orcid.org/0000-0002-7261-0233, Calcagno, Cristiano, 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 [Article] (doi:10.1145/1047659.1040327)

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.

Actions (login required)

View Item

Statistics

DownloadsShow export options

Export as CSVXMLJSON

Activity Overview

6 month trend

0Downloads

6 month trend

489Hits

Additional statistics are available via IRStats2.