A Logic-Based Framework for Verifying Consensus Algorithms
No abstract available.
Related papers
- LiDO-DAG: A Framework for Verifying Safety and Liveness of DAG-Based Consensus Protocols PLDI 2025
- SureDistrib: Verifying Almost-Sure Termination of Composite Asynchronous Byzantine Protocols PLDI 2026
- Formally verified asymptotic consensus in robust networks TACAS 2024
- Bolt-On Strong Consistency: Specification, Implementation, and Verification OOPSLA 2025
- Verifying Almost-Sure Termination for Randomized Distributed Algorithms POPL 2026
- Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics CAV 2019
- Paxos Consensus, Deconstructed and Abstracted ESOP 2018
- Cutoff Bounds for Consensus Algorithms CAV 2017