A Mechanical Proof of Segall's PIF Algorithm

Formal Aspects of Computing

Volumn 9, Issue 2, 1997, Pages 208-226

  Hesselink, Wim H ^a  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

Asynchrony; Distributed algorithm; Graph; Invariant; Message; Theorem prover

Indexed keywords

EID: 0013078711     PISSN: 09345043     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01211619     Document Type: Article

References (13)

1. Apt K, R, and Olderog, E.-R.: Verification of Sequential and Concurrent Programs. Springer. 1991.
2. Boyer, R. S. and Moore, J.: A Computational Logic Handbook. Academic Press, Boston. 1988.
3. Ching-Tsun Chou: Mechanical verification of distributed algorithms in higher-order logic. The Computer Journal, 38: 152-161 (1995).
4. Chandy, K. M. and Misra, J.: Parallel Program Design, A Foundation. Addison-Wesley, 1988.
5. Gallager, R. G., Humblet, P. A. and Spira, P. M.: A distributed algorithm for minimum-weight spanning trees. ACM Trees, on Programming Languages and Systems, 5 (1983) 66-77,
6. Hesselink, W. H.: The verified incremental design of a distributed spanning tree algorithm - extended abstract. Computing Science Reports CSR 9602, Groningen 1996,
7. Josephs, M. B.: Receptive process theory. Acta Informatica 29 (1992) 17-31.
8. Lynch, N. A.: Multivalued possibilities mappings. In J.W. de Bakker, W.-P. de Roever, G. Rozenberg (Eds.): Stepwise Refinement of Distributed Systems. LNCS 430, Springer. 1990, pp. 519-543.
9. Owicki, S. and Gries, D.: An axiomatic proof technique for parallel programs. Acta Informatica 6 1976 319-340,
10. Segall, A.: Distributed network protocols. IEEE Transactions on Information Theory, IT-29 (2) 23-35, January 1983.
11. Tel, G.: Distributed Algorithms. Cambridge University Press, 1994.
12. Vaandrager, F. W.: Verification of a distributed summation algorithm. In I. Lee, S.A. Smolka (eds). Proceedings 6th International Conference on Concurrency Theory (Concur'95). LNCS 962, Springer. 1995, pp. 190-203.
13. 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.