Inter-process buffers in separation logic with rely-guarantee

Richard Bornat (1) , Hasan Amjad (2)

1 School of Engineering and Information Sciences
2 Computing Laboratory

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.

Mots clés: Separation logic; Rely-guarantee; Concurrency; Proof

Richard Bornat, Hasan Amjad. Inter-process buffers in separation logic with rely-guarantee. Formal Aspects of Computing, 2010, 22 (6), pp.735-772. ⟨10.1007/s00165-009-0141-8⟩. ⟨hal-00556267⟩