research-article

Open access

The Verified Incremental Design of a Distributed Spanning Tree Algorithm: Extended Abstract

Author:

Wim H. HesselinkAuthors Info & Claims

Formal Aspects of Computing, Volume 11, Issue 1

Pages 45 - 55

https://doi.org/10.1007/s001650050035

Published: 01 September 1999 Publication History

PDF eReader

Abstract.

The paper announces an incremental mechanically–verified design of the algorithm of Gallager, Humblet, and Spira for the distributed determination of the minimum-weight spanning tree in a graph of processes. The processes communicate by means of asynchronous messages with their neighbours in the graph. Messages over one link may pass each other. The proof of the algorithm is based on ghost variables, invariants, and a decreasing variant function. The verification is mechanized by means of the theorem prover Nqthm of Boyer and Moore. This extended abstract is an introduction to the full paper that can be obtained by ftp (http://link.springer.de/link/service/journals/00165/).

Cited By

View all

Altisen KCorbineau PDevismes S(2023)Certification of an exact worst-case self-stabilization timeTheoretical Computer Science10.1016/j.tcs.2022.11.019941:C(262-277)Online publication date: 4-Jan-2023
https://dl.acm.org/doi/10.1016/j.tcs.2022.11.019
Altisen KCorbineau PDevismes S(2021)Certification of an Exact Worst-Case Self-Stabilization TimeProceedings of the 22nd International Conference on Distributed Computing and Networking10.1145/3427796.3427832(46-55)Online publication date: 5-Jan-2021
https://dl.acm.org/doi/10.1145/3427796.3427832
Guttmann W(2018)An algebraic framework for minimum spanning tree problemsTheoretical Computer Science10.1016/j.tcs.2018.04.012744(37-55)Online publication date: Oct-2018
https://doi.org/10.1016/j.tcs.2018.04.012
Show More Cited By

Index Terms

The Verified Incremental Design of a Distributed Spanning Tree Algorithm: Extended Abstract

Index terms have been assigned to the content through auto-classification.

Recommendations

The distributed spanning tree: a scalable interconnection topology for efficient and equitable traversal
CCGRID '05: Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid - Volume 01

Peer-to-peer and grid applications currently have few structures that allow efficient discovery mechanisms in large scale system. The trees can be an appropriate structure for this task. However, the tree's bottlenecks are a significant drawback in ...
Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios
Abstract
Inspired by the seminal works of Khuller et al. (SIAM J. Comput. 25(2), 355–368 (1996)) and Chan (Discrete Comput. Geom. 32(2), 177–194 (2004)) we study the bottleneck version of the Euclidean bounded-degree spanning tree problem. A bottleneck ... $_{}$ $_{}$ $_{}$ $_{} \sqrt{}$ $_{}$ $_{}$ $_{}$ $_{} \sqrt{}$ $_{} \sqrt{}$ $_{} \sqrt{}$ $_{} \sqrt{}$
Degree-bounded minimum spanning tree for unit disk graph

Degree-bounded minimum spanning tree (DBMST) has been widely used in many applications of wireless sensor networks, such as data aggregation, topology control, etc. However, before construction of DBMST, it is NP-hard to determine whether or not there ...

Comments

Information & Contributors

Information

Published In

Formal Aspects of Computing Volume 11, Issue 1

Sep 1999

105 pages

ISSN:0934-5043

EISSN:1433-299X

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 September 1999

Published in FAC Volume 11, Issue 1

Author Tag

Keywords: Minimum spanning tree; Message passing; Asynchronous communication; Theorem proving

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

14
Total Citations
View Citations
43
Total Downloads

Downloads (Last 12 months)26
Downloads (Last 6 weeks)4

Reflects downloads up to 04 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Altisen KCorbineau PDevismes S(2023)Certification of an exact worst-case self-stabilization timeTheoretical Computer Science10.1016/j.tcs.2022.11.019941:C(262-277)Online publication date: 4-Jan-2023
https://dl.acm.org/doi/10.1016/j.tcs.2022.11.019
Altisen KCorbineau PDevismes S(2021)Certification of an Exact Worst-Case Self-Stabilization TimeProceedings of the 22nd International Conference on Distributed Computing and Networking10.1145/3427796.3427832(46-55)Online publication date: 5-Jan-2021
https://dl.acm.org/doi/10.1145/3427796.3427832
Guttmann W(2018)An algebraic framework for minimum spanning tree problemsTheoretical Computer Science10.1016/j.tcs.2018.04.012744(37-55)Online publication date: Oct-2018
https://doi.org/10.1016/j.tcs.2018.04.012
Guttmann W(2016)Relation-Algebraic Verification of Prim’s Minimum Spanning Tree AlgorithmTheoretical Aspects of Computing – ICTAC 201610.1007/978-3-319-46750-4_4(51-68)Online publication date: 22-Sep-2016
https://doi.org/10.1007/978-3-319-46750-4_4
Hesselink W(2013)Verifying a simplification of mutual exclusion by Lycklama---HadzilacosActa Informatica10.1007/s00236-013-0178-250:3(199-228)Online publication date: 1-May-2013
https://dl.acm.org/doi/10.1007/s00236-013-0178-2
Chen MMonin J(2012)Formal Verification of Netlog ProtocolsProceedings of the 2012 Sixth International Symposium on Theoretical Aspects of Software Engineering10.1109/TASE.2012.19(43-50)Online publication date: 4-Jul-2012
https://dl.acm.org/doi/10.1109/TASE.2012.19
Charron-Bost BDebrat HMerz S(2011)Formal verification of consensus algorithms tolerating malicious faultsProceedings of the 13th international conference on Stabilization, safety, and security of distributed systems10.5555/2050613.2050624(120-134)Online publication date: 10-Oct-2011
https://dl.acm.org/doi/10.5555/2050613.2050624
Deng YGrumbach SMonin J(2011)A framework for verifying data-centric protocolsProceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems10.5555/2022067.2022074(106-120)Online publication date: 6-Jun-2011
https://dl.acm.org/doi/10.5555/2022067.2022074
Charron-Bost BDebrat HMerz S(2011)Formal Verification of Consensus Algorithms Tolerating Malicious FaultsStabilization, Safety, and Security of Distributed Systems10.1007/978-3-642-24550-3_11(120-134)Online publication date: 2011
https://doi.org/10.1007/978-3-642-24550-3_11
Deng YGrumbach SMonin J(2011)A Framework for Verifying Data-Centric ProtocolsFormal Techniques for Distributed Systems10.1007/978-3-642-21461-5_7(106-120)Online publication date: 2011
https://doi.org/10.1007/978-3-642-21461-5_7
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract.

Cited By

Index Terms

Recommendations

The distributed spanning tree: a scalable interconnection topology for efficient and equitable traversal

Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios

Degree-bounded minimum spanning tree for unit disk graph

Comments

Information

Published In

Publisher

Publication History

Author Tag

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations