Skip to main content
SpringerLink
Log in

Proving a real time algorithm for ATM in Coq

  • Conference paper
  • First Online:
Types for Proofs and Programs (TYPES 1996)

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

Included in the following conference series:

Abstract

This paper presents the techniques used for proving, in the framework of type theory, the correctness of an algorithm recently standardized at ITU-T that handles time explicitly. The structure of the proof and its formalization in Coq are described, as well as the main tools which have been developed: an abstract model of “real-time” that makes no assumption on the nature of time and a way to actually find proofs employing transitivity, using only logical definitions and an existing tactic.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Alur C. Courcoubetis and D. Dill. Model-Checking for Real-Time Systems. In 5th Symp. on Logic in Compouter Science. IEEE, 1990.

    Google Scholar 

  2. K. M. Chandy and J. Misra. Parallel Program Design. Austin, Texas, Addison-Wesley, 1989.

    MATH  Google Scholar 

  3. D. Clark, E. M. Emerson eand A. P. Sistla. Automatic verification of finite state concurrent systems using temporal logic specifications: a practical approach. Proc. 10th ACM Symp. on Principles of Programming Languages. 1983.

    Google Scholar 

  4. B. Barras, S. Boutin, C. Cornes, J. Courant, J-C. Filliâtre, E. Giménez, H. Herbelin, G. Huet, P. Manoury, C. Muñoz, C. Murthy, C. Parent, C. Paulin-Mohring, A. Saibi and B. Werner, The Coq Proof Assistant User's Guide, version 6.1 (INRIA-Rocquencourt et CNRS-ENS Lyon, November 1996)

    Google Scholar 

  5. ITU-T Recommendation I.361.1 Traffic control and congestion control in B-ISDN, February 1997

    Google Scholar 

  6. E. Harel O. Lichtenstein and A. Pnueli. Explicit clock temporal logic. In 5th Symp. on Logic in Compouter Science. IEEE, 1990.

    Google Scholar 

  7. Thomas A. Henzinger, Xavier Nicollin, Joseph Sifakis, and Sergio Yovine. Symbolic Model Checking for Real-Time Systems, Information and Computation, 111 (1994) 193–244

    Article  MATH  MathSciNet  Google Scholar 

  8. L. Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16–3 (1994), 872–923.

    Article  Google Scholar 

  9. Jean-François Monin and Francis Klay Formal specification and correction of I.371.1 algorithm for ABR conformance, internal report NT DTL/MSV/003, CNET. 1997

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DTL/MSV, France Télécom-CNET, 2, av. P. Marzin, 22307, Lannion Cedex

    Jean-François Monin

Authors
  1. Jean-François Monin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Eduardo Giménez Christine Paulin-Mohring

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Monin, JF. (1998). Proving a real time algorithm for ATM in Coq. In: Giménez, E., Paulin-Mohring, C. (eds) Types for Proofs and Programs. TYPES 1996. Lecture Notes in Computer Science, vol 1512. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0097797

Download citation

  • DOI: https://doi.org/10.1007/BFb0097797

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65137-6

  • Online ISBN: 978-3-540-49562-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation