Skip to main content

Assertional verification of a timer based protocol

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 317))

Included in the following conference series:

Abstract

We introduce a timer-based protocol skeleton for end-to-end data transport and connection management. The verification of the skeleton is done using a technique of system-wide invariants. To our knowledge, this is the first time this technique is applied to timer-based distributed algorithms. The approach is extended to handle the case of inaccurate timers. Thus, the contribution of this paper is not only a rigid correctness proof of a timer-based communication protocol, but also the extension of the proof method of system-wide invariants to a wider class of distributed algorithms.

This work was supported by the Foundation for Computer Science (SION) of the Netherlands Organization for Scientific Research (NWO). The author's UUCP address is mcvax!ruuinf!gerard.

This paper is an extended abstract. Omitted details and proofs are found in the full paper [Te87].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6 References

  1. Belsnes, D., Single-Message Communication, IEEE Trans. Communications COM-24 (1976) 190–194.

    Google Scholar 

  2. Chandy, K.M., J. Misra, A Foundation of Parallel Program Design, Addison-Wesley Publ. Comp., Reading, Mass., 1988.

    Google Scholar 

  3. Fletcher, J.G., R.W. Watson, Mechanisms for a Reliable Timer-based Protocol, Computer Networks 2 (1978) 271–290.

    Google Scholar 

  4. Krogdahl, S., Verification of a Class of Link-level Protocols, BIT 21 (1978) 436–488.

    Google Scholar 

  5. Lamport, L., An Assertional Correctness Proof of a Distributed Algorithm, Science of Computer Programming 2 (1982) 175–206.

    Google Scholar 

  6. Shankar, A.U., S.S. Lam, Time-dependent Distributed Systems: Proving Safety, Liveness, and Real-time Properties, Distributed Computing 2 (1987) 61–79.

    Google Scholar 

  7. Schoone, A.A., Verification of Connection Management Protocols, Techn. Rep. RUU-CS-87-14, Dept. of Computer Science, University of Utrecht, Utrecht, 1987.

    Google Scholar 

  8. Schoone, A.A., G. Tel, Assertional Verification of a Termination Detection Algorithm, Techn. Rep. RUU-CS-88-6, Dept. of Computer Science, University of Utrecht, Utrecht, 1988.

    Google Scholar 

  9. Schoone, A.A., J. van Leeuwen, Verification of Balanced Link-level Protocols, Techn. Rep. RUU-CS-85-12, Dept. of Computer Science, University of Utrecht, Utrecht, 1985.

    Google Scholar 

  10. Tanenbaum, A., Computer Networks, Prentice Hall, Englewood Cliffs, NJ, 1981.

    Google Scholar 

  11. Tel, G., Assertional Verification of a Timer Based Protocol, Techn. Rep. RUU-CS-87-15, Dept. of Computer Science, University of Utrecht, Utrecht, 1987.

    Google Scholar 

  12. Watson, R.W., Timer-based Mechanisms in Reliable Transport Protocol Connection Management, Computer Networks 5 (1981) 47–56.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Timo Lepistö Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tel, G. (1988). Assertional verification of a timer based protocol. In: Lepistö, T., Salomaa, A. (eds) Automata, Languages and Programming. ICALP 1988. Lecture Notes in Computer Science, vol 317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19488-6_145

Download citation

  • DOI: https://doi.org/10.1007/3-540-19488-6_145

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19488-0

  • Online ISBN: 978-3-540-39291-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics