An assertional proof for a construction of an atomic variable

Authors:
Wim H. Hesselink
Affiliations:
Rijksuniversiteit Groningen, Department of Mathematics and Computing Science, P.O. Box 800, 9700, AV Groningen, The Netherlands
Venue:
Formal Aspects of Computing
Year:
2004

Citing 0
Cited 3

A challenge for atomicity verification

Science of Computer Programming
Simulation Refinement for Concurrency Verification

Electronic Notes in Theoretical Computer Science (ENTCS)
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

Quantified Score

Hi-index	0.00

Visualization

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.