Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms
Abstract elided by the publisher.
Related papers
- PSync: a partially synchronous language for fault-tolerant distributed algorithms POPL 2016
- Efficient Fault-Tolerant Algorithms for Distributed Resource Allocation TOPLAS 1995
- Diffusion Tree Restructuring for Indirect Reference Counting ISMM 2000
- Fault tolerance via idempotence POPL 2013
- Adoption protocols for fanout-optimal fault-tolerant termination detection PPoPP 2013
- Programming at the edge of synchrony OOPSLA 2020
- Communication-Closed Asynchronous Protocols CAV 2019
- A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms POPL 2017