Verification of randomized distributed algorithms

DOI10.1007/3-540-44667-2_6MaRDI QIDQ4547768zbMATH OpenFDO

Authors Roberto Segala

Publication date 21 August 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2090/20900232

Mathematics Subject Classification ID

Distributed algorithms (68W15) Randomized algorithms (68W20) Analysis of algorithms (68W40)

Recommendations

• Validation of Stochastic Systems
• Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
• The probabilistic model checking landscape
• Automated verification of a randomized distributed consensus protocol using cadence SMV and PRISM
• Computer Aided Verification

Cited in

(10)

• Layered reasoning for randomized distributed algorithms
• Structuring and verifying distributed algorithms
• Certified impossibility results and analyses in Coq of some randomised distributed algorithms
• Automated verification of a randomized distributed consensus protocol using cadence SMV and PRISM
• RDA: a Coq library to reason about randomised distributed algorithms in the message passing model
• The probabilistic model checking landscape
• Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
• Validation of Stochastic Systems
• Randomized Lower Bound for Distributed Spanning-Tree Verification
• Computer Aided Verification

This page was built for publication: Verification of randomized distributed algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4547768)