An assertional proof for a construction of an atomic variable-Reference-Cited by-同舟云学术

An assertional proof for a construction of an atomic variable

Published:2004-11 Issue:4 Volume:16 Page:387-393
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Hesselink Wim H.¹

Affiliation:

1. Department of Mathematics and Computing Science, Rijksuniversiteit Groningen, P.O. Box 800, 9700, AV Groningen, The Netherlands

Abstract

Abstract. The paper proves by assertional means the correctness of a construction of Haldar and Subramanian of an atomic shared variable for one writer and one reader. This construction uses four unsafe variables and four safe boolean variables. Assignment to a safe but nonatomic variable is modelled as a repetition of random assignments concluded by an actual assignment. The proof obligation consists of four invariants. These are proved using 25 auxiliary invariants. The proof has been constructed and verified with the theorem prover NQTHM.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s00165-004-0038-5.pdf

Reference5 articles.

1. Invariants for the construction of a handshake register;York WH;Inf Process Lett,1998

2. events files of concprelude and regvarHS [ Lam 86] Lamport L ( 1986 ) On interprocess communication Parts I and II. Distrib Comput 1 : 77 - 101 [Lam94] Lamport L (1994) The temporal logic of actions. ACM Trans Program Lang Syst 16:872-923 [Lyn96] Lynch NA (1996) Distributed algorithms. Morgan Kaufman San Francisco [Tro89] Tromp J (1989) How to construct an atomic variable. In : Bermond J-C Raynal M (eds) Distributed algorithms proceedings

3. nice. (LNCS 392) Springer Berlin Heidelberg New York pp 292-302

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On space-optimality of buffer-based conflict-free constructions of 1-writer 1-reader multivalued atomic variables from safe bits;Journal of Parallel and Distributed Computing;2009-01

2. A queue based mutual exclusion algorithm;Acta Informatica;2008-12-02

3. Simulation Refinement for Concurrency Verification;Electronic Notes in Theoretical Computer Science;2008-06

4. A challenge for atomicity verification;Science of Computer Programming;2008-03

5. A criterion for atomicity revisited;Acta Informatica;2007-04-11