A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
On Process-Algebraic Proof Methods for Fault Tolerant Distributed Systems
[chapter]
2009
Lecture Notes in Computer Science
Distributed Algorithms are hard to prove correct. In settings with process failures, things get worse. Among the proof methods proposed in this context, we focus on process calculi, which offer a tight connection of proof concepts to the actual code representing the algorithm. We use Distributed Consensus as a case study to evaluate recent developments in this field. Along the way, we find that the classical assertional style for proofs on distributed algorithms can be used to structure
doi:10.1007/978-3-642-02138-1_13
fatcat:ac6cmzi4yfdrbbr6inywlmtos4