Verification by construction of distributed algorithms

DOI10.1007/978-3-030-32505-3_2OpenAlexW2982096383MaRDI QIDQ2279110FDOQ2279110

Authors: Dominique Mery Edit this on Wikidata

Publication date: 12 December 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-32505-3_2

Recommendations

• Formal and incremental construction of distributed algorithms: on the distributed reference counting algorithm
• Modelling and verification of Distributed Algorithms
• Formal Verification of Distributed Algorithms
• An automata-theoretic approach to the verification of distributed algorithms
• Testing and Proving Distributed Algorithms in Constructive Type Theory

zbMATH Keywords

verificationmodellingdistributed algorithmsrefinementcorrect-by-constructionproof assistant

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited In (6)

• Verification of distributed programs using representative interleaving sequences
• Formal Verification of Distributed Algorithms
• Title not available (Why is that?)
• Correctness proofs of distributed termination algorithms
• Modelling and verification of Distributed Algorithms
• Structuring and verifying distributed algorithms

Uses Software

• Rodin
• ViSiDiA

This page was built for publication: Verification by construction of distributed algorithms

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