Formal Model–Driven Design of Distributed Algorithms

DOI10.1016/J.ENTCS.2009.08.027zbMath1291.68429OpenAlexW2010137932MaRDI QIDQ5170275

Morten Kühnrich

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

zbMATH Keywords

formal verificationfault tolerancemodel checkingdistributed consensusmodel-driven developmentdistributed agreement

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Distributed algorithms (68W15)

Uses Software

• SPIN
• Uppaal
• jSpin

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

This page was built for publication: Formal Model–Driven Design of Distributed Algorithms