Formal verification of a leader election protocol in process algebra

Theoretical Computer Science

Volumn 177, Issue 2, 1997, Pages 459-486

  Fredlund, Lars Åke ^a   Groote, Jan Friso ^b   Korver, Henri ^b  

^a SWEDISH INSTITUTE OF COMPUTER SCIENCE   (Sweden)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS; COMPUTER AIDED ANALYSIS; DATA REDUCTION; FORMAL LOGIC; MAXIMUM PRINCIPLE; NETWORK PROTOCOLS;

EXTREMA FINDING;

INFORMATION THEORY;

EID: 0031144004     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00256-3     Document Type: Article

References (23)

1. J.C.M. Baeten and W.P. Weijland, Process Algebra, Cambridge Tracts in Theoretical Computer Science, Vol. 18 (Cambridge Univ. Press, Cambridge, 1990).
2. M.A. Bezem, R. Bol and J.F. Groote, A formal verification of the alternating bit protocol in the calculus of constructions (revised version). Original version appeared as M.A. Bezem and J.F. Groote, A formal verification of the alternating bit protocol in the calculus of constructions, Tech. Report 88, Logic Group Preprint Series, Utrecht University, March 1993.
3. M.A. Bezem, R. Bol and J.F. Groote, A formal verification of the alternating bit protocol in the calculus of constructions (revised version). Original version appeared as M.A. Bezem and J.F. Groote, A formal verification of the alternating bit protocol in the calculus of constructions, Tech. Report 88, Logic Group Preprint Series, Utrecht University, March 1993.
4. M.A. Bezem and J.F. Groote, A correctness proof of a one bit sliding window protocol in μCRL, Computer J. 37 (4) (1994) 289-307.
5. M.A. Bezem and J.F. Groote, Invariants in process algebra with data, in: Proc. CONCUR '94 Conf. on Concurrency Theory, Lecture Notes in Computer Science, Vol. 836 (Springer, Berlin, 1994) 401-416.
6. J.J. Brunekreef, Process specification in a UNITY format, in: A. Ponse, C. Verhoef and S.F.M. van Vlijmen, eds., Proc. Workshop on Algebra of Communicating Processes ACP94, Workshops in Computing (Springer, Berlin, 1995) 319-337.
7. J.J. Brunekreef, J.-P. Katoen, R.L.C. Koymans and S. Mauw, Algebraic specification of dynamic leader election protocols in broadcast networks, in: A. Ponse, C. Verhoef and S.F.M. van Vlijmen, eds., Proc. Workshop on Algebra of Communicating Processes ACP'94, Workshops in Computing (Springer, Berlin, 1995) 338-358.
8. J.J. Brunekreef, J.-P. Katoen, R.L.C. Koymans and S. Mauw, Design and analysis of dynamic leader election protocols in broadcast networks, Distributed Comput. 9 (4) (1996) 157-171.
9. K.M. Chandy and J. Misra, Parallel Program Design. A Foundation (Addison-Wesley, Reading, MA, 1988).
10. T. Coquand and G. Huet, The calculus of constructions, Inform. and Control (76) (1988).
11. D. Dolev, M. Klawe and M. Rodeh, An O(n log n) unidirectional distributed algorithm for extrema finding in a circle, J. Algorithms (3): (1982) 245-260.
12. J.F. Groote and H. Korver, A correctness proof of the bakery protocol in μCRL, in: A. Ponse, C. Verhoef and S.F.M. van Vlijmen, eds., Proc. workshop on Algebra of Communicating Processes ACP94, Workshops in Computing (Springer, Berlin, 1995) 63-105.
13. J.F. Groote and A. Ponse, The syntax and semantics of μCRL, in: A. Ponse, C. Verhoef and S.F.M. van Vlijmen, eds., Proc. workshop on Algebra of Communicating Processes ACP94, Workshops in Computing (Springer, Berlin, 1995) 26-62. Tech. Report CS-R9076, CWI, Amsterdam, 1990.
14. J.F. Groote and A. Ponse, Proof theory for μCRL: a language for processes with data, in: D.J. Andrews, J.F. Groote and C.A. Middelburg, eds., Proc. Internat. Workshop on Semantics of Specification Languages, Workshops in Computing (Springer, Berlin, 1994) 231-250.
15. J.F. Groote and M.P.A. Sellink, Confluency for process verification, in: Proc. CONCUR '95 Conf. on Concurrency Theory, Lecture Notes in Computer Science, Vol. 962 (Springer, Berlin, 1995) 204-218.
16. J.F. Groote and J. van de Pol, A bounded retransmission protocol for large data packets. A case study in computer checked algebraic verification, Tech. Report 100, Department of Philosophy, Utrecht University, 1993.
17. H. Korver, Protocol Verification in μCRL, Ph.D. Thesis, University of Amsterdam, 1994.
18. H. Korver and J. Springintveld, A computer-checked verification of Milner's scheduler, in: Proc. 2nd Internat. Symp. on Theoretical Aspects of Computer Software, Sendai, Japan, Lecture Notes in Computer Science, Vol. 769 (Springer, Berlin, 1994) 161-178.
19. N.A. Lynch and M.R. Tuttle, An introduction to input/output automata, CWI Quart., 2(3) (1989) 219-246.
20. R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science, Vol. 92 (Springer, Berlin, 1980).
21. G.L. Peterson, An O(n log n) unidirectional algorithm for the circular extrema problem, ACM Trans. Programming Languages Systems 4 (4): (October 1982) 758-762.
22. M.P.A. Sellink, Verifying process algebra proofs in type theory, in: D.J. Andrews, J.F. Groote, and C.A. Middelburg, eds. Proc. Internat. Workshop on Semantics of Specification Languages, Workshops in Computing (Springer, Berlin, 1994) 314-338.
23. F.W. Vaandrager, Uitwerking take-home tentamen protocolverificatie, Unpublished manuscript, in Dutch, 1993.