A new proof of the GHS minimum spanning tree algorithm

Authors:
Yoram Moses;Benny Shimony
Affiliations:
Department of Electrical Engineering, Technion—Israel Institute of Technology, Haifa, Israel;Department of Electrical Engineering, Technion—Israel Institute of Technology, Haifa, Israel
Venue:
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Year:
2006

Citing 7
Cited 1

A lattice-structured proof of a minimum spanning

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Understanding and verifying distributed algorithms using stratified decomposition

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
From sequential layers to distributed processes: deriving a distributed minimum weight spanning tree algorithm

PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Temporal verification of reactive systems: safety

Temporal verification of reactive systems: safety
A Distributed Algorithm for Minimum-Weight Spanning Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed Algorithms

Distributed Algorithms
Transition Refinement for Deriving a Distributed Minimum Weight Spanning Tree Algorithm

ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets

A framework for verifying data-centric protocols

FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper provides a proof of correctness for the celebrated Minimum Spanning Tree protocol of Gallager, Humblet and Spira [GHS83]. Both the protocol and the quest for a natural correctness proof have had considerable impact on the literature concerning network protocols and verification. We present an invariance proof that is based on a new intermediate-level abstraction of the protocol. A central role of the intermediate-level configurations in the proof is to facilitate the statement of invariants and other properties of the executions of GHS at the low level. This provides a powerful tool for both the statement and the proof of properties of the algorithm. The result is the first proof that follows the spirit of the informal arguments made in the original paper.