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. The hand-written proofs of these invariants have been verified with a mechanical theorem prover.</p
Using the fiction of atomicity as a design abstraction and then refining atomicity as we develop an ...
AbstractTwo protocols for implementing n-writer m-reader atomic registers with 1-writer m-reader ato...
Tromp's construction of a waitfree atomic register for one writing process and one reading process i...
A criterion is presented to prove atomicity of read-write objects by means of ghost variables and in...
Abstract. A criterion is presented to prove atomicity of read-write ob-jects by means of ghost varia...
The paper proves by assertional means the correctness of a construction of an atomic shared variable...
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...
Concurrent and reactive programs are specified by their behaviours in the presence of a nondetermini...
Abstract. Atomicity (or linearizability) is a commonly used consistency criterion for distributed se...
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...
We present process-algebraic models of multi-writer multi-reader safe, regular and atomic registers....
An unpublished algorithm of Haldar and Vidyasankar implements an atomic variable of an arbitrary typ...
Using the fiction of atomicity as a design abstraction and then refining atomicity as we develop an ...
AbstractTwo protocols for implementing n-writer m-reader atomic registers with 1-writer m-reader ato...
Tromp's construction of a waitfree atomic register for one writing process and one reading process i...
A criterion is presented to prove atomicity of read-write objects by means of ghost variables and in...
Abstract. A criterion is presented to prove atomicity of read-write ob-jects by means of ghost varia...
The paper proves by assertional means the correctness of a construction of an atomic shared variable...
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...
Concurrent and reactive programs are specified by their behaviours in the presence of a nondetermini...
Abstract. Atomicity (or linearizability) is a commonly used consistency criterion for distributed se...
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...
We present process-algebraic models of multi-writer multi-reader safe, regular and atomic registers....
An unpublished algorithm of Haldar and Vidyasankar implements an atomic variable of an arbitrary typ...
Using the fiction of atomicity as a design abstraction and then refining atomicity as we develop an ...
AbstractTwo protocols for implementing n-writer m-reader atomic registers with 1-writer m-reader ato...
Tromp's construction of a waitfree atomic register for one writing process and one reading process i...