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
| Type | Article |
|---|---|
| Title | Permission accounting in separation logic. |
| Authors | Bornat, 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. |
| Research Group | Foundations of Computing group |
| Publisher | Association for Computing Machinery (ACM) |
| Journal | 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '05), Long Beach, California, USA. Proceedings |
| ISSN | 0362-1340 |
| Publication dates | |
| 01 Jan 2005 | |
| Publication process dates | |
| Deposited | 13 Oct 2008 |
| Output status | Published |
| Digital Object Identifier (DOI) | https://doi.org/10.1145/1047659.1040327 |
| Language | English |
| Page range | 259-270 |
Permalink -
https://repository.mdx.ac.uk/item/80qz3
99
total views0
total downloads0
views this month0
downloads this month