Modular formal verification of specifications of concurrent systems

In this paper, we propose a bottom‐up approach for the verification of systems with modular structure: we prove that when the modules are composed in specific ways, the complete software system verifies a composition of the properties each component does. We focus on the process of upgrading systems with new functionalities, where the validity of old requirements needs to be ensured, but also an understanding of the new properties the upgraded system would enjoy is useful. In this work, we assume each component to be specified by a CCS process, and the properties to be expressed by selective mu‐calculus formulae. Copyright © 2007 John Wiley & Sons, Ltd.

[1]  Edmund M. Clarke,et al.  Compositional model checking , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[2]  Howard Barringer,et al.  Assumption generation for software component verification , 2002, Proceedings 17th IEEE International Conference on Automated Software Engineering,.

[3]  Roberto Barbuti,et al.  Reduced Models for Efficient CCS Verification , 2005, Formal Methods Syst. Des..

[4]  Franck van Breugel,et al.  Modelling and verifying web service orchestration by means of the concurrency workbench , 2004, SOEN.

[5]  Thomas A. Henzinger,et al.  Automating Modular Verification , 1999, CONCUR.

[6]  Kedar S. Namjoshi,et al.  On the completeness of compositional reasoning , 2000 .

[7]  Corina S. Pasareanu,et al.  Towards a Compositional SPIN , 2006, SPIN.

[8]  Frank Tip,et al.  A survey of program slicing techniques , 1994, J. Program. Lang..

[9]  Dilian Gurov,et al.  Compositional Verification of CCS Processes , 1999, Ershov Memorial Conference.

[10]  Bernd Finkbeiner,et al.  Abstraction and Modular Verification of Infinite-State Reactive Systems , 1997, Requirements Targeting Software and Systems Engineering.

[11]  Kathi Fisler,et al.  The Influence of Software Module Systems on Modular Verification , 2002, SPIN.

[12]  Kedar S. Namjoshi,et al.  Abstract Patterns of Compositional Reasoning , 2003, CONCUR.

[13]  Tommaso Bolognesi,et al.  Tableau methods to describe strong bisimilarity on LOTOS processes involving pure interleaving and enabling , 1994, FORTE.

[14]  Roberto Barbuti,et al.  LORETO: a tool for reducing state explosion in verification of LOTOS programs , 1999, Softw. Pract. Exp..

[15]  Krzysztof R. Apt,et al.  Logics and Models of Concurrent Systems , 1989, NATO ASI Series.

[16]  Alex Groce,et al.  Modular verification of software components in C , 2003, 25th International Conference on Software Engineering, 2003. Proceedings..

[17]  Annapaola Marconi,et al.  Automated synthesis of composite BPEL4WS Web services , 2005, IEEE International Conference on Web Services (ICWS'05).

[18]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[19]  Antonella Santone,et al.  Automatic verification of concurrent systems using a formula-based compositional approach , 2002, Acta Informatica.

[20]  Klaus Havelund,et al.  Model checking JAVA programs using JAVA PathFinder , 2000, International Journal on Software Tools for Technology Transfer.

[21]  Kathi Fisler,et al.  Modular verification of collaboration-based software designs , 2001, ESEC/FSE-9.

[22]  Jessica Chen.  On Verifying Distributed Multithreaded Java Programs , 2004, Software Quality Journal.

[23]  Patrick Maier.  Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete , 2003, FoSSaCS.

[24]  Rance Cleaveland,et al.  The NCSU Concurrency Workbench , 1996, CAV.

[25]  Colin Stirling,et al.  An Introduction to Modal and Temporal Logics for CCS , 1991, Concurrency: Theory, Language, And Architecture.

[26]  Orna Grumberg,et al.  Model checking and modular verification , 1994, TOPL.

[27]  Corina S. Pasareanu,et al.  Learning Assumptions for Compositional Verification , 2003, TACAS.

[28]  Cormac Flanagan,et al.  Thread-Modular Model Checking , 2003, SPIN.

[29]  Maria Luisa Villani,et al.  Model Checking Multithreaded Programs by Means of Reduced Models , 2004, LDTA@ETAPS.