Wim H. Hesselink  Home/Search
Context Related
| cs.rug.nl/~wim/pub/whh239b.pdf.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.rug.nl/~wim/pub/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A criterion is presented to prove atomicity of read-write objects by means of ghost variables and invariants. The criterion is applied to Bloom's construction of a two-writer atomic register from two one-writer atomic registers and to the algorithm of Vitanyi and Awerbuch for the construction of a read-write object with m readers and writers, based on m 2 read-write objects for one reader and one writer. In both cases, the proof comes down to the verification of a number of invariants.... (Update)
Context of citations to this paper: More
.... by Clark [10] using Petri nets) by Rushby [59] using model checking) and by Henderson and Paynter [18] using PVS) Hesselink [21] have verified some atomic register constructions from the computer science literature using ACL2. TTA uses a protocol called NBW...
...whose values are nondecreasing. This requirement is certainly necessary for atomicity, but may not be sufficient. However, Hesselink [Hes02] identifies a criterion for atomicity that explicitly associates sequence numbers with values written and read; we can regard the...
Cited by: More
Using Eternity Variables to Specify and Prove a Serializable.. - Hesselink (2003) (Correct)
A proof of Bloom's two-writer protocol - Abraham (2003) (Correct)
Model Checking Simpson's Four-Slot Fully Asynchronous.. - Rushby (2002) (Correct)
Similar documents (at the sentence level):
7.8%: A Criterion for Atomicity - Hesselink (2000) (Correct)
Active bibliography (related documents): More All
0.5: Progress with Java threads - As Dining Philosophers (Correct)
0.2: Almost Wait-free Resizable Hashtables - Gao Department Of (Correct)
0.2: Ecient Almost Wait-free Parallel Accessible Dynamic Hashtables - Gao Groote Hesselink (2004) (Correct)
Similar documents based on text: More All
0.5: Preference Rankings in the Face of Uncertainty - Hesselink (2002) (Correct)
0.5: Eternity Variables to Simulate Specifications - Hesselink (2002) (Correct)
0.3: Universal Extensions to Simulate Specifications - Wim Hesselink Th (2004) (Correct)
Related documents from co-citation: More All
3: Distributed Algorithms (context) - Lynch - 1996
2: The non-blocking write protocol NBW: A solution to a real-time synchronization p.. (context) - Kopetz, Reisinger - 1993
2: TTP-- A protocol for fault-tolerant real-time systems (context) - Kopetz, Grunsteidl - 1994
BibTeX entry: (Update)
Wim H. Hesselink. An assertional criterion for atomicity. Acta Informatica, 28(5):343--366, 2002. 15 http://citeseer.ist.psu.edu/hesselink01assertional.html More
@article{ hesselink02assertional,
author = "Wim H. Hesselink",
title = "An assertional criterion for atomicity",
journal = "Acta Informatica",
volume = "28",
number = "5",
pages = "343-366",
year = "2002",
url = "citeseer.ist.psu.edu/hesselink01assertional.html" }
Citations (may not include all citations):718 Distributed Algorithms (context) - Lynch - 1996
606 How to make a multiprocessor computer that correctly execute.. (context) - Lamport - 1979
334 A Computational Logic Handbook (context) - Boyer, Moore - 1988
326 Linearizability: A Correctness Condition for Concurrent Obje.. (context) - Herlihy, Wing - 1990
274 The existence of refinement mappings - Abadi, Lamport - 1991
210 Co-operating sequential processes (context) - Dijkstra - 1968
208 An axiomatic proof technique for parallel programs (context) - Owicki, Gries - 1976
125 Wait--free synchronization - Herlihy - 1991
95 Verification of Sequential and Concurrent Programs (context) - Apt, Olderog - 1991
60 The serializability of concurrent database updates - Papadimitriou - 1979
52 Parts I and II (context) - Lamport - 1986
48 Constructing two-writer atomic registers (context) - Bloom - 1988
32 Atomic shared register access by asynchronous hardware (context) - Vitanyi, Awerbuch
31 How to construct an atomic variable (context) - Tromp - 1989
16 How to make a correct multiprocess program execute correctly.. - Lamport - 1997
10 Program proving: coroutines (context) - Clint - 1973
5 Authorized Excerpts from a Proposed Second Edition (context) - Boyer, Moore
4 Wait--free linearization with a mechanical proof (context) - Hesselink - 1995
2 Theories for mechanical proofs of imperative programs - Hesselink - 1997
1 van: On a method of multiprogramming (context) - Feijen, Gasteren - 1999
1 Invariants for the construction of a handshake register - Hesselink - 1998
1 We moeten software leren beheersen (context) - Groote - 1999
www.cs.rug.nl/~wim/mechver/imperative/
Documents on the same site (http://www.cs.rug.nl/~wim/pub/index.html): More
A mechanical proof of Segall's PIF algorithm - Hesselink (1997) (Correct)
Eternity Variables to Simulate Specifications - Hesselink (2002) (Correct)
The Design of a Linearization of a Concurrent Data Object - Hesselink (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC