On Verifying Fault Tolerance of Distributed Protocols
Abstract elided by the publisher.
Related papers
- Communication-Closed Asynchronous Protocols CAV 2019
- Asphalion: trustworthy shielding against Byzantine faults OOPSLA 2019
- Adoption protocols for fanout-optimal fault-tolerant termination detection PPoPP 2013
- A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms POPL 2017
- A multiparty session typing discipline for fault-tolerant event-driven distributed programming OOPSLA 2021
- Verifying Safety of Synchronous Fault-Tolerant Algorithms by Bounded Model Checking TACAS 2019
- Transparent fault tolerance for scalable functional computation JFP 2016
- Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics CAV 2019