Skip to main content
SpringerLink
Log in

Proving the Correctness of the Standardized Algorithm for ABR Conformance

  • Published:
Formal Methods in System Design Aims and scope Submit manuscript

Abstract

Conformance control for ATM cells is based on a real-time reactive algorithm which delivers a value depending on inputs from the network. This value must always fit with a well defined theoretical value. We present here the correctness proof of the algorithm standardized for the ATM transfer capability called ABR. The proof turned out to produce a key argument during the standardization process of ABR.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. “Traffic control and congestion control in B-ISDN,” ITU-T, Recommendation I.371.1.

  2. J.-R. Abrial, The B-Book: Assigning Programs to Meanings, Cambridge University Press, 1996.

  3. J.-R. Abrial, “Développement de l'algorithme ABR,” Personal communication, 1999.

  4. R. Alur and D.L. Dill, “A theory of timed automata,” Theoretical Computer Science, Vol. 126, No. 2, pp. 183–235, 1994.

    Google Scholar 

  5. A. Arnold, “MEC:Asystem for constructing and analysing transition systems,” in J. Sifakis (Ed.), Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems, Vol. 407 of LNCS, Berlin, pp. 117–132, 1990.

    Google Scholar 

  6. B. Barras, S. Boutin, C. Cornes, J. Courant, Y. Coscoy, D. Delahaye, D. de Rauglaudre, J.C. Filliâtre, E. Gimènez, H. Herbelin, G. Huet, H. Laulhère, C. Muñoz, C. Murthy, C. Parent, P. Loiseleur, C. Paulin-Mohriny, A. Saïbi, and B. Werner, “The Coq proof assistant reference manual: Version 6.1,” Technical Report RT-0203, INRIA, 1997.

  7. J. Bengtsson, K.G. Larsen, F. Larsson, P. Pettersson, and W. Yi, “UPPAAL: A tool suite for the automatic verification of real-time systems,” in R. Alur, T.A. Henzinger, and E.D. Sontag (Eds.), Hybrid Systems III Vol. 1066 of Lecture Notes in Computer Science, pp. 232–243, 1996.

  8. B. Bérard and L. Fribourg, “Automated verification of a parametric real-time program: The ABR conformance protocol,” in CAV'99, Lecture Notes in Computer Science, Vol. 1633, pp. 96–107, 1999.

    Google Scholar 

  9. B. Bérard, L. Fribourg, F. Klay, and J.-F. Monin, “A compared study of two correctness proofs for the standardized algorithm of ABR conformance,” Report LSV-99-7, ENS de Cachan, 1999.

  10. D. Clark, E.M. Emerson, and A.P. Sistla, “Automatic verification of finite state concurrent systems using temporal logic specifications: A practical approach,” in Proc. 10th ACMSymp. on Principles of Programming Languages, 1983.

  11. E.W. Dijkstra, A Discipline of Programming, Prentice-Hall, Englewood Cliffs, NJ, 1976.

    Google Scholar 

  12. L. Fribourg, “A closed-form evaluation for extended timed automata,” Research Report LSV-98-2, Lab. Specification and Verification, ENS de Cachan, France, p. 17, 1998.

    Google Scholar 

  13. N. Halbwachs, Synchronous Programming of Reactive Systems, Kluwer Academic Publishers, 1993.

  14. T.A. Henzinger, P.-H. Ho, and H. Wong-Toi, “HYTECH: A model checker for hybrid systems,” Lecture Notes in Computer Science, Vol. 1254, pp. 460–463, 1997.

    Google Scholar 

  15. C. Jard, J.-F. Monin, and R. Groz, “Development of veda, a prototyping tool for distributed algorithms,” IEEE Transactions on Software Engineering, Vol. 14, No. 3, pp. 339–352, 1988.

    Google Scholar 

  16. J.-F. Monin, “Proving a real time algorithm for ATM in Coq,” in E. Gimenez and C. Paulin-Mohring (Eds.), Types for Proofs and Programs, Vol. 1512 of LNCS, Springer Verlag, pp. 277–293, 1998.

  17. J.-F. Monin and F. Klay, “Correctness proof the standardized algorithm for ABR conformanc,” in J. Wing, J. Woodcock, and J. Davies (Eds.), FM'99, Vol. 1708 of LNCS, Springer Verlag, pp. 662–681, 2000.

  18. S. Owre, J.M. Rushby, and N. Shankar, “PVS: A prototype verification system,” in D. Kapur (Ed.), 11th International Conference on Automated Deduction (CADE), Vol. 607 of LNCS, Springer Verlag, pp. 748–752, 1992.

  19. J.P. Queille and J. Sifakis, “Specification and verification of concurrent systems in CESAR,” in Proc. 5th Int'l Symp. on Programming, Lecture Notes in Computer Science, Vol. 137, SV, Berlin, pp. 337–371, 1982.

    Google Scholar 

  20. C. Rabadan, “L'ABR et sa conformité,” NT DAC/ARP/034 CNET, 1997.

  21. P.Z. Revesz, “A closed-form evaluation for Datalog queries with integer (gap)-order constraints,” Theoretical Computer Science, Vol. 116, No. 1, pp. 117–149, 1993.

    Google Scholar 

  22. M. Rusinowitch, S. Stratulat, and F. Klay, “Mechanical verification of a generic incremental ABR conformance algorithm,” Technical Report RT-3794, INRIA, 1999.

Download references

Author information

Authors and Affiliations

  1. Technopole Anticipa, France Télécom R&D DTL/MSV, 2 av. Pierre Marzin, 22307, Lannion, France

    Jean-François Monin

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

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Monin, JF. Proving the Correctness of the Standardized Algorithm for ABR Conformance. Formal Methods in System Design 17, 221–243 (2000). https://doi.org/10.1023/A:1026586217026

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1026586217026

Search

Navigation