Variables as resources in separation logic.
Bornat, Richard and Calcagno, Cristiano and Yang, Hongseok (2006) Variables as resources in separation logic. 21st Annual Conference on Mathematical Foundations of Programming Semantics (MFPS XXI), Birmingham, UK. Proceedings in Electronic Notes in Theoretical Computer Science. Elsevier B.V., 155 . pp. 247-276. ISSN 1571-0661
Full text is not in this repository.
Official URL: http://www.elsevier.com/locate/entcs
This item is available in the Library Catalogue
This paper applied the separation logic notions of ownership and permission to ‘stack' variables that made it possible to banish the variable-use side conditions (e.g. on concurrency and frame rules) which bedevil proof in Hoare logic. The paper contained a formal proof system and some example proofs, together with a suggested model. This work has so far been useful to the small community that is building automated reasoning tools based on separation logic. Its ideas are essential to Parkinson and Vafeiadis' recent treatment of rely/guarantee and separation logic, and to Parkinson's proof of the concurrent stack.
|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
|Deposited On:||13 Oct 2008 16:17|
|Last Modified:||09 Dec 2014 16:52|
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