A strategy for automatic verification of stabilization of distributed algorithms

DOI10.1007/978-3-319-19195-9_3MaRDI QIDQ2827449zbMATH OpenOpenAlexFDO

Authors Ritwika Ghosh, Sayan Mitra

Publication date 19 October 2016

Published in Formal Techniques for Distributed Objects, Components, and Systems (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-01767335/file/978-3-319-19195-9_3_Chapter.pdf

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• Towards Automatic Convergence Verification of Self-stabilizing Algorithms
• scientific article; zbMATH DE number 1696676
• An automata-theoretic approach to the verification of distributed algorithms
• An automata-theoretic approach to the verification of distributed algorithms
• Structuring and verifying distributed algorithms

Cited in

(10)

• Towards Automatic Convergence Verification of Self-stabilizing Algorithms
• Convergence Verification: From Shared Memory to Partially Synchronous Systems
• Mostly Automated Formal Verification of Loop Dependencies with Applications to Distributed Stencil Algorithms
• Self-stabilizing distributed algorithms by gellular automata
• A method for the verification of a distributed and synchronized algorithm
• scientific article; zbMATH DE number 3503135 (Why is no real title available?)
• Verifying recurrence properties in self-stabilization by checking the absence of finite counterexamples
• scientific article; zbMATH DE number 1696676 (Why is no real title available?)
• An automata-theoretic approach to the verification of distributed algorithms
• A Formalized Theory for Verifying Stability and Convergence of Automata in PVS

This page was built for publication: A strategy for automatic verification of stabilization of distributed algorithms

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