Proof-checking a data link protocol

  • L. Helmink
  • M. P. A. Sellink
  • F. W. Vaandrager
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 806)


A data link protocol developed and used by Philips Electronics is modeled and verified using I/O automata theory. Correctness is computer-checked with the Coq proof development system.

Key words

Communication Protocols I/O Automata Proof-Checking Protocol Verification Type Theory 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    K. Apt, N. Francez, and S. Katz. Appraising fairness in languages for distributed programming. Distributed Computing, 2:226–241, 1988.Google Scholar
  2. 2.
    H. Barendregt. Lambda calculi with types. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, pages 117–309. Oxford University Press, 1992.Google Scholar
  3. 3.
    M. Bezem and J. Groote. A formal verification of the alternating bit protocol in the calculus of constructions. Logic Group Preprint Series 88, Dept. of Philosophy, Utrecht University, Mar. 1993.Google Scholar
  4. 4.
    G. v. Bochmann and D. Probst, editors. Proceedings of the 4th International Conference on Computer Aided Verification, volume 663 of Lecture Notes in Computer Science. Springer-Verlag, 1992.Google Scholar
  5. 5.
    D. Bosscher, I. Polak, and F. Vaandrager. Verification of an audio control protocol. Report CS-R94XX, CWI, Amsterdam, 1994. In preparation.Google Scholar
  6. 6.
    CCITT Fascicle VIII.3. CCITT Recommendation X.25. Interface between DTE and DCE for Terminals Operating in the Packet Mode on Public Data Networks, 1988.Google Scholar
  7. 7.
    R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench: A semantics based tool for the verification of concurrent systems. ACM Trans. Prog. Lang. Syst., 1(15):36–72, 1993.Google Scholar
  8. 8.
    C. Courcoubetis, editor. Proceedings of the 5th International Conference on Computer Aided Verification, Elounda, Greece, June/July 1993, volume 697 of Lecture Notes in Computer Science. Springer-Verlag, 1993.Google Scholar
  9. 9.
    G. Dowek, A. Felty, H. Herbelin, G. Huet, C. Murthy, C. Parent, C. Paulin-Mohring, and B. Werner. The Coq proof assistant user's guide. Version 5.8. Technical report, INRIA — Rocquencourt, May 1993.Google Scholar
  10. 10.
    U. Engberg, P. Grønning, and L. Lamport. Mechanical verification of concurrent systems with TLA. In Bochmann and Probst [4].Google Scholar
  11. 11.
    M. Gordon. HOL: a proof generating system for higher-order logic. In G. Birtwistle and P. Subrahmanyam, editors, VLSI Specification, Verification and Synthesis. Kluwer Academic Publishers, 1988.Google Scholar
  12. 12.
    J. Groote and J. van de Pol. A bounded retransmission protocol for large data packets. Logic Group Preprint Series 100, Dept. of Philosophy, Utrecht University, Oct. 1993.Google Scholar
  13. 13.
    J. Guttag and J. Horning. Larch: Languages and Tools for Formal Specification. Springer-Verlag, 1993.Google Scholar
  14. 14.
    M. Hofmann. Extensional Concepts in Intensional Type Theory. PhD thesis, University of Edinburgh, 1994. Forthcoming.Google Scholar
  15. 15.
    B. Jonsson. Compositional Verification of Distributed Systems. PhD thesis, Department of Computer Systems, Uppsala University, 1987. DoCS 87/09.Google Scholar
  16. 16.
    L. Lamport. How to write a proof. Research Report 94, Digital Equipment Corporation, Systems Research Center, Feb. 1993.Google Scholar
  17. 17.
    P. Loewenstein and D. Dill. Verification of a multiprocessor cache protocol using simulation relations and higher-order logic (summary). In E. Clarke and R. Kurshan, editors, Proceedings of the 2nd International Conference on Computer-Aided Verification, New Brunswick, NJ, USA June 1990, volume 531 of Lecture Notes in Computer Science, pages 302–311. Springer-Verlag, 1991.Google Scholar
  18. 18.
    Z. Luo, R. Pollack, and P. Taylor. How to use LEGO. Technical Report LFCS-TN-27, University of Edinburgh, Edinburgh, Scotland, Oct. 1989.Google Scholar
  19. 19.
    N. Lynch and M. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, pages 137–151, Aug. 1987. A full version is available as MIT Technical Report MIT/LCS/TR-387.Google Scholar
  20. 20.
    N. Lynch and M. Tuttle. An introduction to input/output automata. CWI Quarterly, 2(3):219–246, Sept. 1989.Google Scholar
  21. 21.
    N. Lynch and F. Vaandrager. Forward and backward simulations — part I: Untimed systems. Report CS-R9313, CWI, Amsterdam, Mar. 1993.Google Scholar
  22. 22.
    S. Mauw and G. Veltink, editors. Algebraic Specification of Communication Protocols. Cambridge Tracts in Theoretical Computer Science 36. Cambridge University Press, 1993.Google Scholar
  23. 23.
    T. Nipkow. Formal verification of data type refinement — theory and practice. In J. de Bakker, W. d. Roever, and G. Rozenberg, editors, Proceedings REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalism, Correctness, Mook, The Netherlands, May/June 1989, volume 430 of Lecture Notes in Computer Science, pages 561–591. Springer-Verlag, 1990.Google Scholar
  24. 24.
    C. Paulin-Mohring. Inductive definitions in the system Coq. Rules and properties. In M. Bezem and J. Groote, editors, Proceedings of the 1st International Conference on Typed Lambda Calculi and Applications, TCLA'93, Utrecht, The Netherlands, volume 664 of Lecture Notes in Computer Science, pages 328–345. Springer-Verlag, 1993.Google Scholar
  25. 25.
    L. Paulson. Isabelle: The next 700 theorem provers. In P. Odifreddi, editor, Logic and Computer Science. Academic Press, 1989.Google Scholar
  26. 26.
    J. Søgaard-Andersen, S. Garland, J. Guttag, N. Lynch, and A. Pogosyants. Computer-assisted simulation proofs. In Courcoubetis [8], pages 305–319.Google Scholar
  27. 27.
    A. Tanenbaum. Computer networks. Prentice-Hall International, Englewood Cliffs, 1981.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • L. Helmink
    • 1
  • M. P. A. Sellink
    • 2
  • F. W. Vaandrager
    • 3
  1. 1.Philips Research LaboratoriesNetherlands
  2. 2.Utrecht UniversityNetherlands
  3. 3.CWI and University of AmsterdamNetherlands

Personalised recommendations