Verification by construction of distributed algorithms

DOI10.1007/978-3-030-32505-3_2MaRDI QIDQ2279110zbMATH OpenOpenAlexFDO

Authors Dominique Mery

Publication date 12 December 2019

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

zbMATH Keywords

verificationmodellingdistributed algorithmsrefinementcorrect-by-constructionproof assistant

Mathematics Subject Classification ID

Theory of computing (68Qxx)

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

Cited in

(6)

• Verification of distributed programs using representative interleaving sequences
• Formal Verification of Distributed Algorithms
• scientific article; zbMATH DE number 7453194 (Why is no real title available?)
• Correctness proofs of distributed termination algorithms
• Modelling and verification of Distributed Algorithms
• Structuring and verifying distributed algorithms

Describes a project that uses

Uses Software

• ViSiDiA
• Rodin

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)