SVL: A Scripting Language for Compositional Verification

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.

[1]  Kuo-Chung Tai,et al.  An incremental approach to reachability analysis of distributed programs , 1993, Proceedings of 1993 IEEE 7th International Workshop on Software Specification and Design.

[2]  Laurent Mounier,et al.  Compositional State Space Generation from Lotos Programs , 1997, TACAS.

[3]  Shing-Chi Cheung,et al.  Context constraints for compositional reachability analysis , 1996, TSEM.

[4]  Hubert Garavel,et al.  OPEN/CÆSAR: An OPen Software Architecture for Verification, Simulation, and Testing , 1998, TACAS.

[5]  Guy Leduc.  Information Technology - Enhancements to LOTOS (E-LOTOS) , 2001 .

[6]  Mehdi T. Harandi,et al.  Workshop on software specification and design , 1988, SOEN.

[7]  Kwok Hung Cheung.  Compositional analysis of complex distributed systems , 1998 .

[8]  Wei Jen Yeh.  Controlling state explosion in reachability analysis , 1993 .

[9]  Nadia Tawbi,et al.  Specification and Verification of the PowerScaleTM Bus Arbitration Protocol: An Industrial Experiment with LOTOS , 1996, FORTE.

[10]  Scott A. Smolka,et al.  Winston: A Tool for Hierarchical Design and Simulation of Concurrent Systems , 1988, Specification and Verification of Concurrent Systems.

[11]  Antti Valmari,et al.  Compositional State Space Generation , 1991, Applications and Theory of Petri Nets.

[12]  Charles Pecheur,et al.  Advanced modelling and verification techniques applied to a cluster file system , 1999, 14th IEEE International Conference on Automated Software Engineering.

[13]  Shing-Chi Cheung,et al.  Enhancing compositional reachability analysis with context constraints , 1993, SIGSOFT '93.

[14]  Mihaela Sighireanu,et al.  A Graphical Parallel Composition Operator for Process Algebras , 1999, FORTE.

[15]  Jean-Claude Fernandez.  ALDEBARAN : un système de vérification par réduction de processus communicants. (Aldebaran : a system of verification of communicating processes by using reduction) , 1988 .

[16]  Dimitra Giannakopoulou,et al.  Model checking for concurrent software architectures , 1999 .

[17]  Michal Young,et al.  Compositional reachability analysis using process algebra , 1991, TAV4.

[18]  Shing-Chi Cheung,et al.  Compositional reachability analysis of finite-state distributed systems with user-specified constraints , 1995, SIGSOFT FSE.

[19]  Joseph Sifakis,et al.  A Toolbox For The Verification Of LOTOS Programs , 1992, International Conference on Software Engineering.

[20]  César Viho,et al.  System design of a CC-NUMA multiprocessor architecture using formal specification, model-checking, co-simulation, and test generation , 2001, International Journal on Software Tools for Technology Transfer.

[21]  Krishan K. Sabnani,et al.  An algorithmic procedure for checking safety properties of protocols , 1989, IEEE Trans. Commun..

[22]  Noel De Palma,et al.  Specification and Verification of a Dynamic Reconfiguration Protocol for Agent-Based Applications , 2001, DAIS.

[23]  Bernhard Steffen,et al.  Compositional Minimization of Finite State Systems , 1990, CAV.