A Unified Categorical Approach for Attributed Graph Rewriting

Attributed graphs are often used in software engineering. Mainly algorithms concerning programs and models transformations are based on rewriting techniques.We suggest a unified categorical approach for the description and the verification of such algorithms and programs. This contribution which is a generalization of the double pushout approach can be seen as a mix between pushout and pullback. This will facilitate the computations on attributes within a unified framework. It should be particularly helpful for model to model transformation in the domain of "Model Driven Architecture".

[1]  Josep Lladós,et al.  Symbol recognition using graphs , 2003, Proceedings 2003 International Conference on Image Processing (Cat. No.03CH37429).

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

[3]  Dániel Varró,et al.  Using Graph Transformation for Practical Model-Driven Software Engineering , 2005, Model-Driven Software Development.

[4]  Hartmut Ehrig,et al.  Introduction to the Algebraic Theory of Graph Grammars (A Survey) , 1978, Graph-Grammars and Their Application to Computer Science and Biology.

[5]  Hartmut Ehrig,et al.  Graph-Grammars: An Algebraic Approach , 1973, SWAT.

[6]  David Chemouil.  Types inductifs, isomorphismes et récriture extensionnelle , 2004 .

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

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

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

[10]  Gabriele Taentzer.  AGG: A Tool Environment for Algebraic Graph Transformation , 1999, AGTIVE.

[11]  Akira Nakamura,et al.  Path-Controlled Graph Grammars for Mutliresolution Image Processing and Analysis , 1993, Dagstuhl Seminar on Graph Transformations in Computer Science.

[12]  Hartmut Ehrig,et al.  Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution , 1999 .

[13]  Hartmut Ehrig,et al.  Graph Transformations in Computer Science , 1994, Lecture Notes in Computer Science.

[14]  Hartmut Ehrig,et al.  Fundamental Theory for Typed Attributed Graph Transformation , 2004, ICGT.

[15]  Hartmut Ehrig,et al.  Overview of Formal Concepts for Model Transformations Based on Typed Attributed Graph Transformation , 2006, Electron. Notes Theor. Comput. Sci..

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

[17]  Uwe Aßmann,et al.  How to Uniformly Specify Program Analysis and Transformation with Graph Rewrite Systems , 1996, CC.

[18]  Harmen Kastenberg.  Towards Attributed Graphs in Groove: Work in Progress , 2006, Electron. Notes Theor. Comput. Sci..

[19]  Hugo Herbelin,et al.  The Coq proof assistant : reference manual, version 6.1 , 1997 .

[20]  Hartmut Ehrig,et al.  Graph-Grammars and Their Application to Computer Science and Biology , 1978, Lecture Notes in Computer Science.

[21]  Luciano Baresi,et al.  Tutorial Introduction to Graph Transformation: A Software Engineering Perspective , 2002, ICGT.

[22]  Annegret Habel,et al.  Relabelling in Graph Transformation , 2002, ICGT.

[23]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[24]  Wolfram Kahl,et al.  A Relation-Algebraic Approach to Graph Structure Transformation , 2001, RelMiCS.