The Verified Incremental Design of a Distributed Spanning Tree Algorithm: Extended Abstract-Reference-Cited by-同舟云学术

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

Published:1999-09 Issue:1 Volume:11 Page:45-55
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Hesselink Wim H.¹

Affiliation:

1. Department of Mathematics and Computing Science, Rijksuniversiteit Groningen, Groningen, The Netherlands, NL

Abstract

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/).

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s001650050035.pdf

Reference11 articles.

1. A distributed algorithm for minimum- weight spanning trees;Gallager R. G.;ACM Trans. on Programming Languages and Systems,1983

2. A mechanical proof of Segall’s PIF algorithm;Hes;Formal Aspects of Computing,1997

3. [Hes98] Hesselink W. H.: The verified incremental design of a distributed spanning tree algorithm. Formal Aspects of Computing 11(E). Web site: http://link.springer.de/link/service/journals/00165/.

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Certification of an exact worst-case self-stabilization time;Theoretical Computer Science;2023-01

2. Certification of an Exact Worst-Case Self-Stabilization Time;International Conference on Distributed Computing and Networking 2021;2021-01-05

3. An algebraic framework for minimum spanning tree problems;Theoretical Computer Science;2018-10

4. Relation-Algebraic Verification of Prim’s Minimum Spanning Tree Algorithm;Theoretical Aspects of Computing – ICTAC 2016;2016

5. Verifying a simplification of mutual exclusion by Lycklama–Hadzilacos;Acta Informatica;2013-03-10