Modular verification of a non-blocking stack.
Bornat, Richard 
ORCID: https://orcid.org/0000-0002-7261-0233, Parkinson, Matthew and O'Hearn, Peter
(2007)
Modular verification of a non-blocking stack.
34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '07), Nice, France. Proceedings.
.
pp. 297-302.
ISSN 0362-1340
[Article]
(doi:10.1145/1190216.1190261)
Abstract
This paper contains a model and a proof of soundness for a range of program logics based on separation logic and including the notions of permission and ownership for stack variables. It shows that there is no loss of expressive power (all proofs in Hoare logic are expressible). This permits the construction of program-reasoning tools that use the notion of ‘variables as resource'.
This is a highly technical piece of work, and its impact will emerge when more tools have been constructed. Variables-as-resource will be necessary if such tools are to emerge.
"
| Item Type: | Article |
|---|---|
| Research Areas: | A. > School of Science and Technology > Computer Science A. > School of Science and Technology > Computer Science > Foundations of Computing group |
| Item ID: | 35 |
| Useful Links: | |
| Depositing User: | Repository team |
| Date Deposited: | 13 Oct 2008 16:40 |
| Last Modified: | 17 Dec 2019 18:07 |
| URI: | https://eprints.mdx.ac.uk/id/eprint/35 |
Actions (login required)
 |
View Item |
Statistics
Additional statistics are available via IRStats2.
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)