ePrints

Proving the Correctness of Simpson's 4-slot ACM Using An Assertional Rely-Guarantee proof method

Lookup NU author(s): Neil Henderson

Downloads

• Published version [.pdf]

Abstract

This paper describes a rely-guarantee proof to show that Simpson's 4-slot single-reader, single-writer ACM is Lamport atomic (as described fully in the paper). First an abstract ACM specification is proved Lamport atomic using an exhaustive assertional method. A formal model of Simpson's 4-slot is then given and this has been proved to be a refinement of the abstract specification using Nipkow's retrieve relation rule. Simpson's 4-slot is then shown to be Lamport atomic using an interleaved concurrency rely-guarantee proof method for shared variable concurrency.

Publication metadata

Author(s): Henderson N

Publication type: Report

Publication status: Published

Series Title: School of Computing Science Technical Report Series

Year: 2003

Pages: 18

Print publication date: 01/06/2003

Source Publication Date: June 2003

Report Number: 800

Institution: School of Computing Science, University of Newcastle upon Tyne

Place Published: Newcastle upon Tyne

URL: http://www.cs.ncl.ac.uk/publications/trs/papers/800.pdf

Share