Inter-process buffers in separation logic with rely-guarantee

Bornat, Richard and Amjad, Hasan (2010) Inter-process buffers in separation logic with rely-guarantee. Formal Aspects of Computing, 22 (6). pp. 735-772. ISSN 0934-5043

Full text is not in this repository.

Abstract

Separation logic allows simple proofs of concurrent algorithms which use blocking mechanisms such as semaphores. It can even deal with non-blocking algorithms. With the addition of mechanisms borrowed from rely-guarantee, we can make reasonably simple proofs of some simple non-blocking algorithms. We show that it extends to proofs of some intricate algorithms, including Simpson’s famous asynchronous four-slot buffer and Harris’s novel three-slot algorithm, in a manner that is arguably simpler than earlier treatments, though we cannot claim that we have yet found proofs that are as simple as we would wish. Our example proofs show functional correctness but do not deal with questions of liveness.

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: 11152
Useful Links:
Depositing User: Teddy ~
Date Deposited: 03 Jul 2013 14:57
Last Modified: 13 Oct 2016 14:27
URI: https://eprints.mdx.ac.uk/id/eprint/11152

Actions (login required)

Edit Item Edit Item