Toggle Main Menu Toggle Search

Open Access padlockePrints

The Formal Classification and Verification of Simpson's 4-slot Asynchronous Communication Mechanism

Lookup NU author(s): Neil Henderson, Dr Stephen Paynter

Downloads


Abstract

This paper critiques and extends Lamport’s taxonomy of asynchronous registers, [8], [9]. This extended taxonomy is used to characterise Simpson’s 4-slot asynchronous communication mechanism (ACM), [15], [16], [17], [18], [19]. A formalisation of the Lamport atomic property and Simpson’s original 4-slot implementation is given in the PVS logic [12]. We prove that the 4-slot is atomic using Nipkow’s retrieve relation proof rules, [10], [11], [7]. A description is given of the formal proofs, which have been discharged in the PVS theorem prover [13].


Publication metadata

Author(s): Henderson N, Paynter S

Editor(s): Eriksson, L.-H., Lindsay, P.A.

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

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

Year of Conference: 2002

Pages: 350-369

ISSN: 0302-9743 (Print) 1611-3349 (Online)

Publisher: Springer

URL: http://dx.doi.org/10.1007/3-540-45614-7_20

DOI: 10.1007/3-540-45614-7_20

Library holdings: Search Newcastle University Library for this item

Series Title: Lecture Notes in Computer Science

ISBN: 9783540439288


Share