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 agree 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 a key argument during the standardization process of ABR.
Chapter PDF
Similar content being viewed by others
References
J.-R. Abrial. The B-Book: Assigning Programs to Meanings. Cambridge University Press, 1996.
J.-R. Abrial. Développement de l. D’algorithme ABR. Personal communication, 1999.
R. Alur and D. L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183–235, April 1994.
A. Arnold. MEC: A system for constructing and analysing transition systems. In J. Sifakis, editor, Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems, volume 407 of LNCS, pages 117–132, Berlin, June 1990. Springer.
Bruno Barras and all. The coq proof assistant reference manual: Version 6.1. Technical Report RT-0203, INRIA, 1997.
J. Bengtsson, K. G. Larsen, F. Larsson, P. Pettersson, and Wang Yi. UPPAAL: a tool suite for the automatic verification of real-time systems. In R. Alur, T. A. Henzinger, and E. D. Sontag, editors, Hybrid Systems III, volume 1066 of Lecture Notes in Computer Science, pages 232–243. Springer-Verlag, 1996.
B. B. Dérard and L. Fribourg. Automated verification of a parametric real-time program: the ABR conformance protocol. In CAV. D’99, Lecture Notes in Computer Science. Springer-Verlag, 1999. To appear.
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 ACM Symp. on Principles of Programming Languages, 1983.
E. W. Dijkstra. A Discipline of Programming. Prentice-Hall, Englewood Cliffs, NJ, 1976.
L. Fribourg. A closed-form evaluation for extended timed automata. Research Report LSV-98-2, Lab. Specification and Verification, ENS de Cachan, Cachan, France, March 1998. 17 pages.
N. Halbwachs. Synchronous Programming of Reactive Systems. Kluwer Academic Publishers, 1993.
T. A. Henzinger, P.-H. Ho, and H. Wong-Toi. HYTECH: A model checker for hybrid systems. Lecture Notes in Computer Science, 1254:460–463, 1997.
ITU-T. Traffic control and congestion control in B-ISDN. Recommendation I.371.1
C. Jard, J.-F. Monin, and R. Groz. Development of Veda, a Prototyping Tool for Distributed Algorithms. IEEE Transactions on Software Engineering, 14(3): 339–352, march 1988.
Jean-Fran. DÇcois Monin. Proving a real time algorithm for ATM in Coq. In E. Gimenez and C. Paulin-Mohring, editors, Types for Proofs and Programs, volume 1512 of LNCS, pages 277–293. Springer-Verlag, 1998.
J. P. Queille and J. Sifakis. Specification and verification of concurrent systems in CESAR. In Proc.5th Int. D’l Symp.on Programming, Lecture Notes in Computer Science, Vol. 137, pages 337–371. SV, Berlin/New York, 1982.
Christophe Rabadan. L’ABR et sa conformité.NT DAC/ARP/034, CNET, 1997.
P. Z. Revesz. A closed-form evaluation for Datalog queries with integer (gap)-order constraints. Theoretical Computer Science, 116(1):117–149, August 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Monin, JF., Klay, F. (1999). Correctness Proof of the Standardized Algorithm for ABR Conformance. In: Wing, J.M., Woodcock, J., Davies, J. (eds) FM’99 — Formal Methods. FM 1999. Lecture Notes in Computer Science, vol 1708. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48119-2_37
Download citation
DOI: https://doi.org/10.1007/3-540-48119-2_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66587-8
Online ISBN: 978-3-540-48119-5
eBook Packages: Springer Book Archive