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.
Official URL: http://portal.acm.org/citation.cfm?id=1047659.1040...
This item is available in the Library Catalogue
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 Areas:||Middlesex University Schools and Centres > School of Science and Technology > Computer Science|
Middlesex University Schools and Centres > School of Science and Technology > Computer Science > Foundations of Computing group
|Citations on ISI Web of Science:||4|
|Deposited On:||13 Oct 2008 15:59|
|Last Modified:||08 Oct 2014 11:44|
Repository staff only: item control page
Full text downloads (NB count will be zero if no full text documents are attached to the record)
Downloads per month over the past year