Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
From MaRDI portal
(Redirected from Publication:5883751)
Recommendations
- Synthesis of distributed algorithms with parameterized threshold guards
- A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
- Tutorial on parameterized model checking of fault-tolerant distributed algorithms
- SMT and POR beat counter abstraction: parameterized model checking of threshold-based distributed algorithms
Cites work
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 1830912 (Why is no real title available?)
- scientific article; zbMATH DE number 1903348 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- scientific article; zbMATH DE number 3408928 (Why is no real title available?)
- scientific article; zbMATH DE number 7649941 (Why is no real title available?)
- A Reduction Theorem for the Verification of Round-Based Distributed Algorithms
- A logic-based framework for verifying consensus algorithms
- A reduction theorem for randomized distributed algorithms under weak adversaries
- A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
- Asynchronous byzantine agreement protocols
- Asynchronous consensus and broadcast protocols
- Bosco: One-Step Byzantine Asynchronous Consensus
- Byzantizing Paxos by refinement
- Chapar: certified causally consistent distributed key-value stores
- Cutoff bounds for consensus algorithms
- Dafny: an automatic program verifier for functional correctness
- Decidability of model checking for infinite-state concurrent systems
- Decidability of parameterized verification
- Decomposition of distributed programs into communication-closed layers
- Disk paxos
- Eliminating message counters in synchronous threshold automata
- Extracting Symbolic Transitions from TLA$$^{+}$$+ Specifications
- HotStuff
- Impossibility of distributed consensus with one faulty process
- Isabelle/HOL. A proof assistant for higher-order logic
- Model checking Paxos in Spin
- Non-blocking atomic commit in asynchronous distributed systems with failure detectors
- On Verifying Fault Tolerance of Distributed Protocols
- On the completeness of bounded model checking for threshold-based distributed algorithms: reachability
- On the completeness of bounded model checking for threshold-based distributed algorithms: reachability
- On the completeness of verifying message passing programs under bounded asynchrony
- On the minimal synchronism needed for distributed consensus
- Proving properties of a ring of finite-state machines
- Randomized k-set agreement in crash-prone and Byzantine asynchronous systems
- Reachability in parameterized systems: all flavors of threshold automata
- Reaching Agreement in the Presence of Faults
- Reduction
- SMT and POR beat counter abstraction: parameterized model checking of threshold-based distributed algorithms
- Synchronizing the asynchronous
- Synchronous consensus under hybrid process and link failures
- Synthesis of distributed algorithms with parameterized threshold guards
- The Heard-Of model: computing in distributed systems with benign faults
- The correctness proof of Ben-Or's randomized consensus algorithm
- The part-time parliament
- Tight bounds for k-set agreement
- Time, clocks, and the ordering of events in a distributed system
- Tutorial on parameterized model checking of fault-tolerant distributed algorithms
- Unreliable failure detectors for reliable distributed systems
- Verification of consensus algorithms using satisfiability solving
- 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
- \textsc{PSync}: a partially synchronous language for fault-tolerant distributed algorithms
Cited in
(4)
Describes a project that uses
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)
