Simple Modules for GRACE

The language Grace is being proposed for specifying and programming in a graph-centered environment based on graph transformation. Emphasis in the design of Grace is laid on modular structuring of programs. In this paper we present a simple kind of modules for the language which encapsulate rules and graph transformation units, and export some of them. The local transformation units define compound graph transformations that call rules and other transformation units which are either defined by the surrounding module, or imported from other modules. The interleaving semantics of modules specifies a binary relation on graphs for each exported item.

[1]  Manfred Nagl,et al.  Graph-Grammars and Their Application to Computer Science , 1986, Lecture Notes in Computer Science.

[2]  Andy Schürr PROGRESS: A VHL-Language Based on Graph Grammars , 1990, Graph-Grammars and Their Application to Computer Science.

[3]  Hans-Jörg Kreowski,et al.  On the Interleaving Sematics of Transformation Units - A Step into GRACE , 1994, TAGT.

[4]  Ken Arnold,et al.  The Java programming language (2nd ed.) , 1998 .

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

[6]  Jozef Gruska,et al.  Mathematical Foundations of Computer Science 1998 , 1998, Lecture Notes in Computer Science.

[7]  Hans-Jörg Kreowski,et al.  Nested Graph Transformation Units , 1997, Int. J. Softw. Eng. Knowl. Eng..

[8]  Berthold Hoffmann,et al.  From Graph Transformation to Rule-Based Programming with Diagrams , 1999, AGTIVE.

[9]  A. Schfürr,et al.  Programmed graph replacement systems , 1997 .

[10]  Reiko Heckel,et al.  Classification and comparison of module concepts for graph transformation systems , 1999 .

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

[12]  Annegret Habel,et al.  Graph Transformation for Specification and Programming , 1999, Sci. Comput. Program..

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

[14]  Gabriele Taentzer,et al.  DIEGO, another step towards a module concept for graph transformation systems , 1995, SEGRAGRA.

[15]  Andy Schürr,et al.  Programmed Graph Replacement Systems , 1997, Handbook of Graph Grammars.

[16]  Ken Arnold,et al.  The Java Programming Language , 1996 .

[17]  Sabine Kuske,et al.  More About Control Conditions for Transformation Units , 1998, TAGT.

[18]  Francesco Parisi-Presicce,et al.  Spatial and Temporal Refinement of Typed Graph Transformation Systems , 1998, MFCS.

[19]  E. Kay,et al.  Graph Theory. An Algorithmic Approach , 1975 .

[20]  Gabriele Taentzer,et al.  Amalgamated Graph Transformations and Their Use for Specifying AGG - an Algebraic Graph Grammar System , 1993, Dagstuhl Seminar on Graph Transformations in Computer Science.

[21]  G. Engels,et al.  Graph Transformation for Speciication and Programming , 1996 .

[22]  Hartmut Ehrig,et al.  Pragmatic and Semantic Aspects of a Module Concept for Graph Transformation Systems , 1994, TAGT.

[23]  Francesca Rossi,et al.  Graph Processes , 1996, Fundam. Informaticae.