Explicit State Model Checking for Graph Grammars

In this paper we present the philosophy behind the GROOVE project, in which graph transformation is used as a modelling formalism on top of which a model checking approach to software verification is being built. We describe the basic formalism, the current state of the project, and (current and future) challenges.

[1]  Manfred Nagl,et al.  Applications of Graph Transformations with Industrial Relevance , 2004, Lecture Notes in Computer Science.

[2]  Michael Löwe,et al.  Algebraic Approach to Single-Pushout Graph Transformation , 1993, Theor. Comput. Sci..

[3]  Thomas A. Henzinger,et al.  The software model checker B last : Applications to software engineering , 2007 .

[4]  Martin Wirsing,et al.  Extraction of Structured Programs from Specification Proofs , 1999, WADT.

[5]  Arend Rensink,et al.  Abstract Graph Transformation , 2006, SVV@ICFEM.

[6]  Matthew B. Dwyer,et al.  Bogor: A Flexible Framework for Creating Software Model Checkers , 2006, Testing: Academic & Industrial Conference - Practice And Research Techniques (TAIC PART'06).

[7]  Pawel Sobocinski,et al.  Adhesive Categories , 2004, FoSSaCS.

[8]  Christel Baier,et al.  CONCUR 2006 - Concurrency Theory, 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006, Proceedings , 2006, CONCUR.

[9]  Marco Pistore,et al.  History-Dependent Automata: An Introduction , 2005, SFM.

[10]  Arend Rensink,et al.  Canonical Graph Shapes , 2004, ESOP.

[11]  Reiko Heckel,et al.  Graph Transformation for Concurrency and Verification - Preface , 2007 .

[12]  Arend Rensink,et al.  Representing First-Order Logic Using Graphs , 2004, ICGT.

[13]  David L. Dill,et al.  The Murphi Verification System , 1996, CAV.

[14]  Reinhard Wilhelm,et al.  Parametric shape analysis via 3-valued logic , 1999, POPL '99.

[15]  Dániel Varró,et al.  Automated formal verification of visual modeling languages by model checking , 2004, Software & Systems Modeling.

[16]  Brian Campbell,et al.  Amortised Memory Analysis Using the Depth of Data Structures , 2009, ESOP.

[17]  Arend Rensink,et al.  Towards model checking graph grammars , 2003 .

[18]  Arend Rensink,et al.  Defining Object-Oriented Execution Semantics Using Graph Transformations , 2006, FMOODS.

[19]  Hartmut Ehrig,et al.  Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation , 2006, Fundam. Informaticae.

[20]  Vincent Danos,et al.  Reversible Communicating Systems , 2004, CONCUR.

[21]  Hartmut Ehrig,et al.  Efficient Detection of Conflicts in Graph-based Model Transformation , 2006, Electron. Notes Theor. Comput. Sci..

[22]  Andrea Corradini,et al.  A Temporal Graph Logic for Verification of Graph Transformation Systems , 2006, WADT.

[23]  B. König,et al.  Verifying Finite-State Graph Grammars: An Unfolding-Based Approach , 2004, CONCUR.

[24]  Hartmut Ehrig,et al.  Termination Criteria for DPO Transformations with Injective Matches , 2007, Electron. Notes Theor. Comput. Sci..

[25]  Barbara König,et al.  Counterexample-Guided Abstraction Refinement for the Analysis of Graph Transformation Systems , 2006, TACAS.

[26]  Ugo Montanari,et al.  Synchronized Hyperedge Replacement with Name Mobility , 2001, CONCUR.

[27]  Arend Rensink.  Model Checking Quantified Computation Tree Logic , 2006, CONCUR.

[28]  Robin Milner,et al.  Theories for the Global Ubiquitous Computer , 2004, FoSSaCS.

[29]  A. Prasad Sistla,et al.  Symmetry and model checking , 1993, Formal Methods Syst. Des..

[30]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series) , 1992 .

[31]  Arend Rensink,et al.  Isomorphism Checking in GROOVE , 2007, Electron. Commun. Eur. Assoc. Softw. Sci. Technol..

[32]  Arend Rensink.  The GROOVE Simulator: A Tool for State Space Generation , 2003, AGTIVE.

[33]  Thomas A. Henzinger,et al.  The software model checker Blast , 2007, International Journal on Software Tools for Technology Transfer.

[34]  Reiko Heckel,et al.  Graph Grammars with Negative Application Conditions , 1996, Fundam. Informaticae.

[35]  Marco Bernardo,et al.  Formal Methods for Mobile Computing, 5th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, SFM-Moby 2005, Bertinoro, Italy, April 26-30, 2005, Advanced Lectures , 2005, SFM.

[36]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Graph Transformation , 2006, Monographs in Theoretical Computer Science. An EATCS Series.

[37]  Gerard J. Holzmann,et al.  The Model Checker SPIN , 1997, IEEE Trans. Software Eng..

[38]  Grzegorz Rozenberg,et al.  Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations , 1997 .

[39]  Hartmut Ehrig,et al.  Theory of Constraints and Application Conditions: From Graphs to High-Level Structures , 2004, Fundam. Informaticae.

[40]  Hartmut Ehrig,et al.  Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts , 2006, Mathematical Structures in Computer Science.

[41]  Annegret Habel,et al.  Satisfiability of High-Level Conditions , 2006, ICGT.

[42]  Hartmut Ehrig,et al.  Fundamental Theory for Typed Attributed Graphs and Graph Transformation based on Adhesive HLR Categories , 2006, Fundam. Informaticae.

[43]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[44]  Paolo Baldan,et al.  Approximating the Behaviour of Graph Transformation Systems , 2002, ICGT.

[45]  R. Milner,et al.  Bigraphical Reactive Systems , 2001, CONCUR.

[46]  Leila Ribeiro,et al.  Formal Verification of Object-Oriented Graph Grammars Specifications , 2007, GT-VC@CONCUR.