Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM
No abstract available.
Related papers
- Verifying Almost-Sure Termination for Randomized Distributed Algorithms POPL 2026
- Model-Guided Fuzzing of Distributed Systems OOPSLA 2025
- QuickSilver: modeling and parameterized verification for distributed agreement-based systems OOPSLA 2021
- Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics CAV 2019
- Planning for change in a formal verification of the raft consensus protocol CPP 2016
- Formal verification of a distributed dynamic reconfiguration protocol CPP 2022
- Enabling Bounded Verification of Doubly-Unbounded Distributed Agreement-Based Systems via Bounded Regions OOPSLA 2023
- AdoB: Bridging Benign and Byzantine Consensus with Atomic Distributed Objects OOPSLA 2024