Browse by author
Lookup NU author(s): Neil Henderson
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
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. © Springer-Verlag Berlin Heidelberg 2003.
Author(s): Henderson N
Editor(s): Araki, K., Gnesi, S., Mandrioli, D.
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: International Symposium of Formal Methods Europe (FME)
Year of Conference: 2003
Pages: 244-263
ISSN: 0302-9743 (print) 1611-3349 (online)
Publisher: Springer
URL: http://dx.doi.org/10.1007/978-3-540-45236-2_15
DOI: 10.1007/978-3-540-45236-2_15
Library holdings: Search Newcastle University Library for this item
Series Title: Lecture Notes in Computer Science
ISBN: 9783540408284
