Formal Model–Driven Design of Distributed Algorithms
From MaRDI portal
Publication:5170275
DOI10.1016/j.entcs.2009.08.027zbMath1291.68429MaRDI QIDQ5170275
Publication date: 23 July 2014
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2009.08.027
formal verification; fault tolerance; model checking; distributed consensus; model-driven development; distributed agreement
68Q60: Specification and verification (program logics, model checking, etc.)
68W15: Distributed algorithms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Using Bounded Model Checking to Verify Consensus Algorithms
- Unreliable failure detectors for reliable distributed systems
- Monotonic Abstraction in Action
- A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract)
- Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation