Formal Aspects of Computing

, Volume 11, Issue 1, pp 45–55 | Cite as

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

  • Wim H. Hesselink
Original Paper

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Supplementary material

165_2005_90110045_MOESM1_ESM.pdf (355 kb)
Supplementary material, approximately 354 KB.

Copyright information

© BCS 1999

Authors and Affiliations

  • Wim H. Hesselink
    • 1
  1. 1.Department of Mathematics and Computing Science, Rijksuniversiteit Groningen, Groningen, The NetherlandsNL

Personalised recommendations