A Formal Framework for Compositional Verification of Organic Computing Systems

Because of their self-x properties Organic Computing systems are hard to verify. Nevertheless in safety critical domains one may want to give behavioral guarantees. One technique to reduce complexity of the overall verification task is applying composition theorem. In this paper we present a technique for formal specification and compositional verification of Organic Computing systems. Separation of self-x and functional behavior has amongst others, advantages for the formal specification. We present how the specification of self-x behavior can be integrated into an approach for compositional verification of concurrent systems, based on Interval Temporal Logic. The presented approach has full tool support with the KIV interactive theorem prover.

[1]  Martín Abadi,et al.  Conjoining specifications , 1995, TOPL.

[2]  Dov M. Gabbay,et al.  Handbook of Philosophical Logic , 2002 .

[3]  Benjamin C. Pierce,et al.  Theoretical Aspects of Computer Software , 2001, Lecture Notes in Computer Science.

[4]  Catholijn M. Jonker,et al.  Compositional Verification of a Multi-Agent System for One-to-Many Negotiation , 2004, Applied Intelligence.

[5]  Mary Shaw,et al.  Software Engineering for Self-Adaptive Systems: A Research Roadmap , 2009, Software Engineering for Self-Adaptive Systems.

[6]  Rogério de Lemos,et al.  08031 -- Software Engineering for Self-Adaptive Systems: A Research Road Map , 2008, Software Engineering for Self-Adaptive Systems.

[7]  Wolfgang Reif,et al.  A Software Engineering Guideline for Self-Organizing Resource-Flow Systems , 2010, 2010 Fourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems.

[8]  Graeme Smith,et al.  Formal Development of Self-organising Systems , 2009, ATC.

[9]  Maritta Heisel,et al.  A Dynamic Logic for Program Verification , 1989, Logic at Botik.

[10]  Michael Wooldridge,et al.  The Computational Complexity of Agent Verification , 2001, ATAL.

[11]  Paolo Traverso,et al.  Applied Formal Methods — FM-Trends 98 , 1998, Lecture Notes in Computer Science.

[12]  Antonio Cau,et al.  Parallel composition of assumption-commitment specifications , 2009, Acta Informatica.

[13]  Frank Ortmeier,et al.  A Universal Self-Organization Mechanism for Role-Based Organic Computing Systems , 2009, ATC.

[14]  James C. King,et al.  Symbolic execution and program testing , 1976, CACM.

[15]  Catholijn M. Jonker,et al.  Compositional Verification of Multi-Agent Systems in Temporal Multi-Epistemic Logic , 1998, J. Log. Lang. Inf..

[16]  Catholijn M. Jonker,et al.  Compositional Verification of Multi-Agent Systems: A Formal Analysis of Pro-activeness and Reactiveness , 2002, Int. J. Cooperative Inf. Syst..

[17]  Hussein Zedan,et al.  Augmenting semantic web service descriptions with compositional specification , 2004, WWW '04.

[18]  Zohar Manna,et al.  Temporal Verification Diagrams , 1994, TACS.

[19]  Wolfgang Reif,et al.  Interactive Verification of Concurrent Systems using Symbolic Execution , 2010, LPAR Workshops.

[20]  Joey Paquet,et al.  ASSL - Autonomic System Specification Language , 2007, 31st IEEE Software Engineering Workshop (SEW 2007).

[21]  Frank Ortmeier,et al.  A Specification and Construction Paradigm for Organic Computing Systems , 2008, 2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems.

[22]  Wolfgang Reif,et al.  Compositional Proofs with Symbolic Execution , 2008, VERIFY.

[23]  Ben C. Moszkowski,et al.  Executing temporal logic programs , 1986, Seminar on Concurrency.

[24]  Michael Wooldridge,et al.  On the Formal Specification and Verification of Multi-Agent Systems , 1997, Int. J. Cooperative Inf. Syst..

[25]  Frank Ortmeier,et al.  Formal Modeling and Verification of Systems with Self-x Properties , 2006, ATC.

[26]  Rogério de Lemos,et al.  Software Engineering for Self-Adaptive Systems [outcome of a Dagstuhl Seminar] , 2009, Software Engineering for Self-Adaptive Systems.

[27]  Nicholas R. Jennings,et al.  Agent Theories, Architectures, and Languages: A Survey , 1995, ECAI Workshop on Agent Theories, Architectures, and Languages.

[28]  Kurt Stenzel,et al.  KIV 3.0 for Provably Correct Systems , 1998, FM-Trends.

[29]  Saeed Jalili,et al.  PobSAM: Policy-based Managing of Actors in Self-Adaptive Systems , 2010, Electron. Notes Theor. Comput. Sci..

[30]  Jerzy Tiuryn,et al.  Dynamic logic , 2001, SIGA.

[31]  K. Mani Chandy,et al.  Proofs of Networks of Processes , 1981, IEEE Transactions on Software Engineering.

[32]  Cliff B. Jones,et al.  Tentative steps toward a development method for interfering programs , 1983, TOPL.

[33]  Bowen Alpern,et al.  Recognizing safety and liveness , 2005, Distributed Computing.

[34]  Albert R. Meyer,et al.  Logic at Botik '89 , 1989, Lecture Notes in Computer Science.

[35]  Michael Balser,et al.  Verifying concurrent systems with symbolic execution: temporal reasoning is symbolic execution with a little induction , 2006 .