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

Henderson, N

doi:10.1007/b13229

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.