Abstract
This paper tackles the problem of model-checking SDL programs that use the save operator. Previous work on model-checking SDL programs with SPIN consisted in translating SDL into IF (using sdl2if) and finally IF to Promela (if2pml). However, the save operator of SDL is not handled by the (final) translator if2pml. We propose an extension of the if 2pml tool that translates IF into Promela programs with save operators. We also add an abstraction method on buffer messages to if2pml allowing the user to gather some buffer messages into one abstract value. We use our extended version of if2pml to validate an Unmanned Underwater Vehicle (UUV) subsystem specified with SDL.
International Telecommunication Union
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dragan Bosnacki, Dennis Dams, Lesek Holenderski, and Natalia Sidorova. Model checking sdl with spin. In Susanne Graf and Michael Schwartzbach, editors, Tools and Algorithms for the Construction and Analysis of Systems,, number 1785, pages 363–377, Berlin, 2000. LNCS, Springer.
M. Bozga, J.C. Fernandez, L. Ghirvu, S. Graf, J.P. Krimm, L. Mounier, and J. Sifakis. If: An Intermediate Representation for SDL and its Applications. In Proceedings of SDL-FORUM’99, Montreal, Canada, June 1999.
M. Bozga, L. Ghirvu, S. Graf, L. Mounier, and J. Sifakis. The Intermediate Representation IF: Syntax and semantics. Technical report, Vérimag, Grenoble, 1999.
P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by cons truction or approximation of fixpoints. In ACM Press, editor, Proceedings of the 4th Annual Symposium on Principles of Programming Languages,, 1977.
E. Clarke, O. Grumberg, and D. Long. Model checking and abstraction. In Proceedings of the 19th ACM symposium on principles of programming languages, ACM press, New-York, 1992.
Franck Cassez and Olivier Roux. Compilation of the ELECTRE reactive language into finite transition systems. Theoretical Computer Science, 146(1–2):109–143, July 1995.
G.J. Holzmann. The model checker spin. In IEEE Trans. on Software Engineering, volume 23, May 1997.
ITU-T International Telecommunication Union. Annex F.3 to Recommendation Z.100, Specification and Description Language (SDL)-SDL Formal Definition: Dynamic Semantics. 1994.
ITU-T International Telecommunication Union. Recommendation Z.100, Specification and Description Language (SDL). 1994.
G. Sutre, A. Finkel, O. Roux, and F. Cassez. Effective recognizability and model checking of reactive fiffo automata. In Proc. 7th Int. Conf. Algebraic Methodology and Software Technology (AMAST’98),Amazonia, Brazil, Jan. 1999, volume 1548 of Lecture Notes in Computer Science, pages 106–123. Springer, 1999.
TELELOGIC. TAU/SDT 3.3. TELELOGIC, June 1998.
VERILOG. ObjectGEODE 4.0. CS VERILOG, March 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Prigent, A., Cassez, F., Dhaussy, P., Roux, O. (2002). Extending the Translation from SDL to Promela . In: Bošnački, D., Leue, S. (eds) Model Checking Software. SPIN 2002. Lecture Notes in Computer Science, vol 2318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46017-9_8
Download citation
DOI: https://doi.org/10.1007/3-540-46017-9_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43477-1
Online ISBN: 978-3-540-46017-6
eBook Packages: Springer Book Archive