Skip to main content

Advertisement

SpringerLink
  • Log in
Book cover

International Conference on Formal Techniques for Networked and Distributed Systems

FORTE 2001: Formal Techniques for Networked and Distributed Systems pp 377–392Cite as

  1. Home
  2. Formal Techniques for Networked and Distributed Systems
  3. Conference paper
SVL: A Scripting Language for Compositional Verification

SVL: A Scripting Language for Compositional Verification

  • Hubert Garavel5 &
  • Frédéric Lang5 
  • Conference paper

  • 499 Accesses

  • 34 Citations

Part of the IFIP International Federation for Information Processing book series (IFIPAICT,volume 69)

Abstract

Compositional verification is a way to avoid state explosion for the enumerative verification of complex concurrent systems. Process algebras such as Lotos are suitable for compositional verification, because of their appropriate parallel composition operators and concurrency semantics. Extending prior work by Krimm and Mounier, this article presents the SVL language, which allows compositional verification of Lotos descriptions to be performed simply and efficiently. A compiler for SVL has been implemented using an original compiler-generation technique based on the Enhanced Lotos language. This compiler supports several formats and tools for handling Labeled Transition Systems. It is available as a component of the Cadp toolbox and has been applied on various case-studies profitably.

Keywords

  • Abstraction
  • Bisimulation
  • Compositional Verification
  • Concurrency
  • Coordination Language
  • E-Lotos
  • Enumerative Verification
  • Labeled Transition System
  • Lotos
  • Model-Checking
  • Process Algebra
  • Reachability Analysis
  • Specification
  • Validation

This work has been partially supported by Dyade, the Bull/Inria joint venture for advanced reasearch

Download conference paper PDF

References

  1. M. Aguilar Cornejo, H. Garavel, R. Mateescu, N. de Palma. Specification and Verification of a Dynamic Reconfiguration Protocol for Agent-Based Applications. In Proc. of DAIS’01. Kluwer Academic Publishers.

    Google Scholar 

  2. P. Boullier, P. Deschamp. Le système SYNTAX: Manuel d’utilisation et de mise en œuvre sous Unix. http://www-rocq.inria.fr/oscar/www/syntax, 1997.

  3. A. Bouali, A. Ressouche, V. Roy, and R. de Simone. The Fc2Tools set: a Toolset for the Verification of Concurrent Systems. In Proc. of CAV’96, LNCS vol. 1102.

    Google Scholar 

  4. G. Chehaibar, H. Garavel, L. Mounier, N. Tawbi, and F. Zulian. Specification and Verification of the PowerScale Bus Arbitration Protocol: An Industrial Experiment with LOTOS. In Proc. of FORTE/PSTV’96. IFIP.

    Google Scholar 

  5. K. H. Cheung. Compositional Analysis of Complex Distributed Systems. Ph.D. thesis, Hong Kong Univ. of Science and Technology, 1998.

    Google Scholar 

  6. S. C. Cheung and J. Kramer. Enhancing Compositional Reachability Analysis with Context Constraints. In Proc. of FSE’93. ACM.

    Google Scholar 

  7. S. C. Cheung and J. Kramer. Compositional Reachability Analysis of Finite-State Distributed Systems with User-Specified Constraints. In Proc. of FSE’95. ACM.

    Google Scholar 

  8. S. C. Cheung and J. Kramer. Context Constraints for Compositional Reachability. ACM Transactions on Software Engineering Methodology, 1996.

    Google Scholar 

  9. J.-C. Fernandez. ALDEBARAN: un système de vérification par réduction de processus communicants. Thèse de Doctorat, Univ. Joseph Fourier (Grenoble), 1988.

    Google Scholar 

  10. J.-C. Fernandez, H. Garavel, A. Kerbrat, R. Mateescu, L. Mounier, and M. Sighireanu. CADP (CÆSAR/ALDEBARAN Development Package): A Protocol Validation and Verification Toolbox. In Proc. of CAV’96, LNCS vol. 1102.

    Google Scholar 

  11. J.-C. Fernandez, H. Garavel, L. Mounier, A. Rasse, C. Rodríguez, and J. Sifakis. A Toolbox for the Verification of LOTOS Programs. In Proc. of ICSE’92. ACM.

    Google Scholar 

  12. H. Garavel. An Overview of the Eucalyptus Toolbox. In Proc. of the Int. Workshop on Applied Formal Methods in System Design. Univ. of Maribor, Slovenia, 1996.

    Google Scholar 

  13. H. Garavel. OPEN/CÆSAR: An Open Software Architecture for Verification, Simulation, and Testing. In Proc. of TACAS’98. LNCS vol. 1384.

    Google Scholar 

  14. D. Giannakopoulou. Model Checking for Concurrent Software Architectures. Ph.D. thesis, Imp. College of Science, Technology and Medicine — Univ. of London, 1999.

    Google Scholar 

  15. S. Graf and B. Steffen. Compositional Minimization of Finite State Systems. In Proc. of CAV’90, LNCS vol. 531.

    Google Scholar 

  16. H. Garavel and M. Sighireanu. Towards a Second Generation of Formal Description Techniques-Rationale for the Design of E-LOTOS. In Proc. of FMICS’98. CWI.

    Google Scholar 

  17. H. Garavel and M. Sighireanu. A Graphical Parallel Composition Operator for Process Algebras. In Proc. of FORTE/PSTV’99. IFIP.

    Google Scholar 

  18. S. Graf, B. Steffen, and G. Lüttgen. Compositional Minimisation of Finite State Systems using Interface Specifications. Formal Aspects of Computation, Sept. 1996.

    Google Scholar 

  19. H. Garavel, C. Viho, and M. Zendri. System Design of a CC-NUMA Multiprocessor Architecture using Formal Specification, Model-Checking, Co-Simulation, and Test Generation. STTT. Springer-Verlag, July 2001.

    Google Scholar 

  20. ISO/IEC. LOTOS — A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour. International Standard 8807, ISO — Information Processing Systems — OSI, September 1988.

    Google Scholar 

  21. ISO/IEC. Information Technology-Enhancements to LOTOS (E-LOTOS). Juan Quemada, editor, FDIS 15437 ballot, May 2001.

    Google Scholar 

  22. J.-P. Krimm and L. Mounier. Compositional State Space Generation from LOTOS Programs. In Proc. of TACAS’97. LNCS vol. 1217.

    Google Scholar 

  23. J. Malhotra, S. A. Smolka, A. Giacalone, and R. Shapiro. A Tool for Hierarchical Design and Simulation of Concurrent Systems. In Proc. of the Workshop on Specification and Verification of Concurrent Systems. British Computer Society, 1988.

    Google Scholar 

  24. C. Pecheur. Advanced Modelling and Verification Techniques Applied to a Cluster File System. In Proc. of ASE’99. IEEE Computer Society.

    Google Scholar 

  25. M. Sighireanu, X. Bouchoux, C. Chaudet, H. Garavel, M. Herbert, F. Lang, and B. Vivien. TRAIAN: A Compiler for E-LOTOS/LOTOS NT Specifications. http://www.inrialpes.fr/vasy/traian, 2000.

  26. M. Sighireanu. LOTOS NT User’s Manual (Version 2.1). INRIA projet VASY. ftp://ftp.inrialpes.fr/pub/vasy/traian/manual.ps.Z, 2000.

  27. K. K. Sabnani, A. M. Lapone, and M. U. Uyar. An Algorithmic Procedure for Checking Safety Properties of Protocols. IEEE Transactions on Communications, Sept. 1989.

    Google Scholar 

  28. K. C. Tai and V. Koppol. Hierarchy-Based Incremental Reachability Analysis of Communication Protocols. In Proc. of the Int. Conf. on Network Protocols. IEEE, 1993.

    Google Scholar 

  29. K. C. Tai and V. Koppol. An Incremental Approach to Reachability Analysis of Distributed Programs. In Proc. of the Int. Workshop on Software Specification and Design. IEEE, 1993.

    Google Scholar 

  30. A. Valmari. Compositional State Space Generation. In Proc. of Advances in Petri Nets. LNCS vol. 674, 1993.

    Google Scholar 

  31. W. J. Yeh. Controlling State Explosion in Reachability Analysis. Ph.D. thesis, Software Engineering Research Center (SERC) Laboratory, Purdue Univ., Dec. 1993.

    Google Scholar 

  32. W. J. Yeh and M. Young. Compositional Reachability Analysis Using Process Algebra. In Proc. of SIGSOFT’91. ACM.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA Rhône-Alpes, 655, avenue de l’Europe, F-38330, Montbonnot St. Martin, France

    Hubert Garavel & Frédéric Lang

Authors
  1. Hubert Garavel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frédéric Lang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Information and Communications University (ICU), Korea

    Myungchul Kim

  2. Telecommunications Technology Association (TTA), Korea

    Byoungmoon Chin

  3. Korea Telecom (KT), Korea

    Sungwon Kang

  4. Korea IT Industry Promotion Agency (KIPA), Korea

    Danhyung Lee

Rights and permissions

Reprints and Permissions

Copyright information

© 2001 IFIP International Federation for Information Processing

About this paper

Cite this paper

Garavel, H., Lang, F. (2001). SVL: A Scripting Language for Compositional Verification. In: Kim, M., Chin, B., Kang, S., Lee, D. (eds) Formal Techniques for Networked and Distributed Systems. FORTE 2001. IFIP International Federation for Information Processing, vol 69. Springer, Boston, MA. https://doi.org/10.1007/0-306-47003-9_24

Download citation

  • .RIS
  • .ENW
  • .BIB

  • DOI: https://doi.org/10.1007/0-306-47003-9_24

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-7923-7470-1

  • Online ISBN: 978-0-306-47003-5

  • eBook Packages: Springer Book Archive

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Over 10 million scientific documents at your fingertips

Switch Edition
  • Academic Edition
  • Corporate Edition
  • Home
  • Impressum
  • Legal information
  • Privacy statement
  • California Privacy Statement
  • How we use cookies
  • Manage cookies/Do not sell my data
  • Accessibility
  • FAQ
  • Contact us
  • Affiliate program

Not logged in - 3.236.207.90

Not affiliated

Springer Nature

© 2023 Springer Nature Switzerland AG. Part of Springer Nature.