Inter-process buffers in separation logic with rely-guarantee

Bornat, Richard ORCID: https://orcid.org/0000-0002-7261-0233 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 [Article] (doi:10.1007/s00165-009-0141-8)

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.

Actions (login required)

View Item

Statistics

DownloadsShow export options

Export as CSVXMLJSON

Activity Overview

6 month trend

0Downloads

6 month trend

515Hits

Additional statistics are available via IRStats2.