Synthesis of distributed algorithms with parameterized threshold guards
DOI10.4230/LIPICS.OPODIS.2017.32zbMATH Open1487.68252OpenAlexW2769487539MaRDI QIDQ3300835FDOQ3300835
Authors:
Publication date: 30 July 2020
Full work available at URL: https://doi.org/10.4230/LIPIcs.OPODIS.2017.32
Recommendations
Reliability, testing and fault tolerance of networks and computer systems (68M15) Specification and verification (program logics, model checking, etc.) (68Q60) Distributed algorithms (68W15) Distributed systems (68M14) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)
Cites Work
- Chapar: certified causally consistent distributed key-value stores
- Title not available (Why is that?)
- Unreliable failure detectors for reliable distributed systems
- Decidability of parameterized verification
- The Heard-Of model: computing in distributed systems with benign faults
- Synthesis of self-stabilising and Byzantine-resilient distributed systems
- Booting clock synchronization in partially synchronous systems with hybrid process and link failures
- Bosco: One-Step Byzantine Asynchronous Consensus
- SMT and POR beat counter abstraction: parameterized model checking of threshold-based distributed algorithms
- A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
- Synchronous counting and computational algorithm design
- Cutoff bounds for consensus algorithms
- Accuracy of message counting abstraction in fault-tolerant distributed algorithms
- A logic-based framework for verifying consensus algorithms
- Parameterized Synthesis
Cited In (11)
- \textsc{PSync}: a partially synchronous language for fault-tolerant distributed algorithms
- Parameterized Synthesis of Self-Stabilizing Protocols in Symmetric Rings
- Complexity of Verification and Synthesis of Threshold Automata
- Reachability in parameterized systems: all flavors of threshold automata
- Eliminating message counters in synchronous threshold automata
- Coefficient synthesis for threshold automata
- Temporal prophecy for proving temporal properties of infinite-state systems
- Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
- Parameterized synthesis of self-stabilizing protocols in symmetric networks
- Synthesis of self-stabilising and Byzantine-resilient distributed systems
- Synthesis of distributed agreement-based systems with efficiently-decidable verification
Uses Software
This page was built for publication: Synthesis of distributed algorithms with parameterized threshold guards
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3300835)
