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

Formal Aspects of Computing

Volumn 11, Issue 1, 1999, Pages 45-55

  Hesselink, Wim H ^a  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

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

Indexed keywords

ALGORITHMS; MESSAGE PASSING; THEOREM PROVING;

ASYNCHRONOUS COMMUNICATION; DISTRIBUTED SPANNING TREES; EXTENDED ABSTRACTS; INCREMENTAL DESIGNS; MINIMUM SPANNING TREES; MINIMUM WEIGHT SPANNING TREES; THEOREM PROVERS;

TREES (MATHEMATICS);

EID: 0042283218     PISSN: 09345043     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001650050035     Document Type: Article

References (11)

1. Boyer, R. S. and Moore, J.: A Computational Logic Handbook. Academic Press, Boston, 1988.
2. Chou, C. and Gafni, E.: Understanding and verifying distributed algorithms using stratified decomposition. In Proceedings 7th ACM Symposium on Principles of Distributed Computing, 1988.
3. Gallager, R. G., Humblet, P. A. and Spira, P. M.: A distributed algorithm for minimum-weight spanning trees. ACM Trans. on Programming Languages and Systems 5: 66-77, 1983.
4. Hesselink, W. H.: A mechanical proof of Segall's PIF algorithm. Formal Aspects of Computing, 9: 208-226, 1997.
5. 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/.
6. Hesselink, W. H.: Web site: http://www.cs.rug.nl/~wim/ghs
7. Stomp, F. A. and Roever, W.-P. de: Principles for sequential reasoning about distributed algorithms. Formal Aspects of Computing, 6(E), pp 1-70 (1994). Can be retrieved by downloading the file FACj-6E-pl.ps.Z in directory pub/fac of ftp.cs.man.ac.uk.
8. Tarjan, R. E.: Data structures and network algorithms. Society for Industrial and Applied Mathematics 1983.
9. Tel. G.: Distributed Algorithms. Cambridge University Press, 1994.
10. Welch, J., Lamport, L. and Lynch, N.: A lattice-structured proof technique applied to a minimum weight spanning tree algorithm. In Proceedings 7th ACM Symposium on Principles of Distributed Computing, 1988, pp. 28-43.
11. Zwiers, J. and Janssen, W.: Partial order based design of concurrent systems. In J. de Bakker, W.-P. de Roever, and G. Rozenberg (eds.): Proceedings of the REX School/Symposium "A decade of concurrency", Noordwijkerhout, 1993, LNCS 803, Springer Verlag, 1994, pp. 622-684.