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.
We present process-algebraic models of multi-writer multi-reader safe, regular and atomic registers....
This paper presents an algorithm for implementing a k-valued regular register (the logical register)...
Most proof methods for reasoning about concurrent programs are based upon the interleaving semantics...
Abstract. A criterion is presented to prove atomicity of read-write ob-jects by means of ghost varia...
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...
An unpublished algorithm of Haldar and Vidyasankar implements an atomic variable of an arbitrary typ...
Abstract. Atomicity (or linearizability) is a commonly used consistency criterion for distributed se...
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 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...
We present process-algebraic models of multi-writer multi-reader safe, regular and atomic registers....
This paper presents an algorithm for implementing a k-valued regular register (the logical register)...
Most proof methods for reasoning about concurrent programs are based upon the interleaving semantics...
Abstract. A criterion is presented to prove atomicity of read-write ob-jects by means of ghost varia...
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...
An unpublished algorithm of Haldar and Vidyasankar implements an atomic variable of an arbitrary typ...
Abstract. Atomicity (or linearizability) is a commonly used consistency criterion for distributed se...
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 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...
We present process-algebraic models of multi-writer multi-reader safe, regular and atomic registers....
This paper presents an algorithm for implementing a k-valued regular register (the logical register)...
Most proof methods for reasoning about concurrent programs are based upon the interleaving semantics...