Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
From MaRDI portal
Publication:5883751
DOI10.46298/LMCS-19(1:5)2023OpenAlexW3109631881MaRDI QIDQ5883751FDOQ5883751
Author name not available (Why is that?)
Publication date: 22 March 2023
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.14789v4
Cites Work
- Dafny: An Automatic Program Verifier for Functional Correctness
- Chapar: certified causally consistent distributed key-value stores
- Title not available (Why is that?)
- Isabelle/HOL. A proof assistant for higher-order logic
- Title not available (Why is that?)
- Unreliable failure detectors for reliable distributed systems
- Time, clocks, and the ordering of events in a distributed system
- Decidability of model checking for infinite-state concurrent systems
- Impossibility of distributed consensus with one faulty process
- On the minimal synchronism needed for distributed consensus
- Reaching Agreement in the Presence of Faults
- Decidability of Parameterized Verification
- Tight bounds for k -set agreement
- The Heard-Of model: computing in distributed systems with benign faults
- Asynchronous consensus and broadcast protocols
- Decomposition of distributed programs into communication-closed layers
- Title not available (Why is that?)
- Synchronous consensus under hybrid process and link failures
- Proving properties of a ring of finite-state machines
- A Reduction Theorem for the Verification of Round-Based Distributed Algorithms
- Reduction
- Bosco: One-Step Byzantine Asynchronous Consensus
- Title not available (Why is that?)
- Verification of consensus algorithms using satisfiability solving
- SMT and POR beat counter abstraction: parameterized model checking of threshold-based distributed algorithms
- On the completeness of bounded model checking for threshold-based distributed algorithms: reachability
- A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
- Non-blocking atomic commit in asynchronous distributed systems with failure detectors
- Disk Paxos
- Asynchronous byzantine agreement protocols
- The correctness proof of Ben-Or's randomized consensus algorithm
- Title not available (Why is that?)
- Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems
- Cutoff bounds for consensus algorithms
- Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms
- \textsc{PSync}: a partially synchronous language for fault-tolerant distributed algorithms
- A Logic-Based Framework for Verifying Consensus Algorithms
- What You Always Wanted to Know About Model Checking of Fault-Tolerant Distributed Algorithms
- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
- On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability
- Title not available (Why is that?)
- On Verifying Fault Tolerance of Distributed Protocols
- HotStuff
- Synthesis of distributed algorithms with parameterized threshold guards
- The part-time parliament
- On the completeness of verifying message passing programs under bounded asynchrony
- Eliminating message counters in synchronous threshold automata
- A reduction theorem for randomized distributed algorithms under weak adversaries
- Reachability in Parameterized Systems: All Flavors of Threshold Automata
- Title not available (Why is that?)
- Byzantizing Paxos by Refinement
- Title not available (Why is that?)
- Extracting Symbolic Transitions from TLA$$^{+}$$+ Specifications
Cited In (2)
Uses Software
This page was built for publication: Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5883751)
