A framework for semantic reasoning about byzantine quorum systems (2001) [4 citations — 1 self]
Abstract:
We present a set of denitions and theorems that allow us to reason about the semantics of quorum system variables, including Byzantine quorum system variables, as a class. Using these tools, we present a formal proof that the problem of atomic semantics for such variables can be reduced to the simpler problem of regular semantics for such systems. Specically, any regular masking quorum system protocol can be combined with a writeback mechanism to produce an atomic protocol. We then describe a subclass of TS-variables for which the latter problem is not solvable by traditional approaches in an asynchronous environment. Finally, for such variables we dene the notion of pseudoregular and pseudoatomic semantics, and show brie y that the same reduction holds for these concepts.
Citations
| 284 | Byzantine quorum systems – Malkhi, Reiter - 1998 |
| 91 | A Logical Approach to Discrete Math – Gries, Schneider - 1993 |
| 68 | Secure and scalable replication in phalanx – Malkhi, Reiter - 1998 |
| 33 | Atomic Multireader Register – Kirousis, Kranakis, et al. - 1987 |
| 20 | Synchronous Byzantine quorum systems – Bazzi - 1997 |
| 5 | On interprocess communication. Distributed Computing 1 – Lamport - 1986 |
