The verified incremental design of a distributed spanning tree algorithm: Extended abstract

DOI10.1007/S001650050035MaRDI QIDQ1125687zbMATH OpenOpenAlexFDO

Authors W. H. Hesselink

Publication date 2 January 2000

Published in Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL https://pure.rug.nl/ws/files/3164025/1999FormAspCompHesselink1.pdf

zbMATH Keywords

distributed spanning tree algorithm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 2088672
• From sequential layers to distributed processes
• A New Proof of the GHS Minimum Spanning Tree Algorithm
• scientific article; zbMATH DE number 4058884
• A mechanical proof of Segall's PIF algorithm

Cited in

(12)

• Theories for mechanical proofs of imperative programs
• scientific article; zbMATH DE number 2013597 (Why is no real title available?)
• Relation-algebraic verification of Prim's minimum spanning tree algorithm
• scientific article; zbMATH DE number 2088672 (Why is no real title available?)
• Randomized Lower Bound for Distributed Spanning-Tree Verification
• A New Proof of the GHS Minimum Spanning Tree Algorithm
• An algebraic framework for minimum spanning tree problems
• Certification of an exact worst-case self-stabilization time
• Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos
• Proving Distributed Algorithms for Mobile Agents: Examples of Spanning Tree Computation in Anonymous Networks
• A mechanical proof of Segall's PIF algorithm
• A principle for sequential reasoning about distributed algorithms

Describes a project that uses

Uses Software

• NQTHM

This page was built for publication: The verified incremental design of a distributed spanning tree algorithm: Extended abstract

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