Explanation of two non-blocking shared-variable communication algorithms

Bornat, Richard and Amjad, Hasan (2011) Explanation of two non-blocking shared-variable communication algorithms. Formal Aspects of Computing . ISSN 0934-5043

Full text is not in this repository.

Abstract

Simpson and Harris have described multi-slot algorithms implementing a single-place buffer, each operating without explicit hardware synchronisation mechanisms. Conventional refinement and proof techniques have explained that these algorithms work, but do not give convincing descriptions of how they work. An unconventional refinement process starting from the classic single-variable buffer, using both data and atomicity refinement and drawing information from unsuccessful steps, derives each algorithm. The logic used is RGSep, a marriage of rely/guarantee and concurrent separation logic. Extensive detailed verifications are described. The result is an explanation of how the algorithms work and some pointers to how such algorithms might be devised.

Item Type: Article
Keywords (uncontrolled): Separation logic, Rely-guarantee, Concurrency, Proof, Refinement, Atomicity,
Research Areas: A. > School of Science and Technology > Computer Science
A. > School of Science and Technology > Computer Science > Foundations of Computing group
Item ID: 11144
Useful Links:
Depositing User: Teddy ~
Date Deposited: 03 Jul 2013 12:55
Last Modified: 13 Oct 2016 14:27
URI: https://eprints.mdx.ac.uk/id/eprint/11144

Actions (login required)

Edit Item Edit Item