A Fault-Tolerant Sequentially Consistent DSM with a Compositional Correctness Proof
نویسندگان
چکیده
We present the SC-ABD algorithm that implements sequentially consistent distributed shared memory (DSM). The algorithm tolerates that less than half of the processes are faulty (crash-stop). Compared to the multi-writer ABD algorithm, SC-ABD requires one instead of two round-trips of communication to perform a write operation, and an equal number of round-trips (two) to perform a read operation. Although sequential consistency is not a compositional consistency condition, the provided correctness proof is compositional.
منابع مشابه
A Compositinal Proof Theory for Fault Tolerant Real-Time Distributed Systems
In this report we present a compositional network proof theory to specify and verify fault tolerantreal-time distributed systems. Important in such systems is the failure hypothesis that stipulatesthe class of failures that must be tolerated. In the formalism presented in this report, the failurehypothesis of a system is represented by a predicate which expresses how faults migh...
متن کاملA Correctness Proof for a Byzantine-Fault-Tolerant Read/Write Atomic Memory with Dynamic Replica Membership
We prove correctness of a Byzantine-fault-tolerant replication algorithm for a read/write atomic memory that supports a dynamic replica set.
متن کاملA Formal Method for Developing Provably Correct Fault-Tolerant Systems Using Partial Refinement and Composition
It is widely agreed that building correct fault-tolerant systems is very difficult. To address this problem, this paper introduces a new model-based approach for developing masking fault-tolerant systems. As in component-based software development, two (or more) component specifications are developed, one implementing the required normal behavior and the other(s) the required fault-handling beh...
متن کاملThe Proof of Correctness of a Fault-Tolerant Circuit Design
We describe a formally verified implementation of the ‘‘Oral Messages’’ algorithm of Pease, Shostak, and Lamport [4, 5]. An abstract implementation of the algorithm has been verified to achieve interactive consistency in the presence of faults [1]. This abstract characterization is then mapped down to a hardware level implementation which inherits the fault-tolerant characteristics of the abstr...
متن کاملSynthesis of Fault - Tolerant Concurrent
Methods for mechanically synthesizing concurrent programs from temporal logic speciications have been proposed (cf. EC82, MW84, PR89, PR89b, AM94]). An important advantage of these synthesis methods is that they obviate the need to manually construct a program and compose a proof of its correctness. A serious drawback of these methods in practice, however, is that they produce concurrent progra...
متن کامل