Toggle Main Menu Toggle Search

Open Access padlockePrints

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

Lookup NU author(s): Neil Henderson

Downloads


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: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: International Symposium of Formal Methods (FME 2003: Formal Methods)

Year of Conference: 2003

Pages: 244-263

Date deposited: 26/11/2004

ISSN: 0302-9743

Publisher: Springer

URL: http://dx.doi.org/10.1007/b13229

DOI: 10.1007/b13229

Library holdings: Search Newcastle University Library for this item

Series Title: Lecture Notes in Computer Science

ISBN: 9783540408284


Share