Permission accounting in separation logic.

Article


Bornat, R., Calcagno, C., Parkinson, M. and O'Hearn, P. 2005. Permission accounting in separation logic. 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '05), Long Beach, California, USA. Proceedings. https://doi.org/10.1145/1047659.1040327
TypeArticle
TitlePermission accounting in separation logic.
AuthorsBornat, R., Calcagno, C., Parkinson, M. and O'Hearn, P.
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.

Research GroupFoundations of Computing group
PublisherAssociation for Computing Machinery (ACM)
Journal32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '05), Long Beach, California, USA. Proceedings
ISSN0362-1340
Publication dates
Print01 Jan 2005
Publication process dates
Deposited13 Oct 2008
Output statusPublished
Digital Object Identifier (DOI)https://doi.org/10.1145/1047659.1040327
LanguageEnglish
Page range259-270
Permalink -

https://repository.mdx.ac.uk/item/80qz3

  • 30
    total views
  • 0
    total downloads
  • 0
    views this month
  • 0
    downloads this month

Export as