Abstract. A criterion is presented to prove atomicity of read-write ob-jects 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 con-struction of a read-write object with m readers and writers, based on m2 read-write objects for one reader and one writer. In both cases, the proof comes down to the verification of a number of invariants. The hand-written proofs of these invariants have been verified with a mechanical theorem prover.
Tromp’s construction of a waitfree atomic register for one writing process and one reading process i...
This paper presents an algorithm for implementing a k-valued regular register (the logical register)...
Concurrent and reactive programs are specified by their behaviours in the presence of a nondetermini...
A criterion is presented to prove atomicity of read-write objects by means of ghost variables and in...
An unpublished algorithm implements an atomic variable of an arbitrary type T for one writer and one...
The paper proves by assertional means the correctness of a construction of an atomic shared variable...
Abstract. Atomicity (or linearizability) is a commonly used consistency criterion for distributed se...
An unpublished algorithm of Haldar and Vidyasankar implements an atomic variable of an arbitrary typ...
AbstractAn unpublished algorithm of Haldar and Vidyasankar implements an atomic variable of an arbit...
Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and...
Atomicity (or linearizability) is a commonly used consistency criterion for distributed services an...
AbstractTwo protocols for implementing n-writer m-reader atomic registers with 1-writer m-reader ato...
We present process-algebraic models of multi-writer multi-reader safe, regular and atomic registers....
We define a class of operations called pseudo read-modify-write (PRMW) operations, and show that non...
Abstract—Modern Internet-scale storage systems often provide weak consistency in exchange for better...
Tromp’s construction of a waitfree atomic register for one writing process and one reading process i...
This paper presents an algorithm for implementing a k-valued regular register (the logical register)...
Concurrent and reactive programs are specified by their behaviours in the presence of a nondetermini...
A criterion is presented to prove atomicity of read-write objects by means of ghost variables and in...
An unpublished algorithm implements an atomic variable of an arbitrary type T for one writer and one...
The paper proves by assertional means the correctness of a construction of an atomic shared variable...
Abstract. Atomicity (or linearizability) is a commonly used consistency criterion for distributed se...
An unpublished algorithm of Haldar and Vidyasankar implements an atomic variable of an arbitrary typ...
AbstractAn unpublished algorithm of Haldar and Vidyasankar implements an atomic variable of an arbit...
Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and...
Atomicity (or linearizability) is a commonly used consistency criterion for distributed services an...
AbstractTwo protocols for implementing n-writer m-reader atomic registers with 1-writer m-reader ato...
We present process-algebraic models of multi-writer multi-reader safe, regular and atomic registers....
We define a class of operations called pseudo read-modify-write (PRMW) operations, and show that non...
Abstract—Modern Internet-scale storage systems often provide weak consistency in exchange for better...
Tromp’s construction of a waitfree atomic register for one writing process and one reading process i...
This paper presents an algorithm for implementing a k-valued regular register (the logical register)...
Concurrent and reactive programs are specified by their behaviours in the presence of a nondetermini...