Communications of the ACM
Hypergraph rewriting: critical pairs and undecidability of confluence
Term graph rewriting
Handbook of formal languages, vol. 3
Solving shape-analysis problems in languages with destructive updating
ACM Transactions on Programming Languages and Systems (TOPLAS)
The PROGRES approach: language and environment
Handbook of graph grammars and computing by graph transformation
Hyperedge Replacement: Grammars and Languages
Hyperedge Replacement: Grammars and Languages
Concepts and realization of a diagram editor generator based on hypergraph transformation
Science of Computer Programming - Special issue on applications of graph transformations (GRATRA 2000)
Shapely Hierarchical Graph Transformation
HCC '01 Proceedings of the IEEE 2001 Symposia on Human Centric Computing Languages and Environments (HCC'01)
Context-exploiting shapes for diagram transformation
Machine Graphics & Vision International Journal - Special issue on diagrammatics & Design
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
Shaped Generic Graph Transformation
Applications of Graph Transformations with Industrial Relevance
Adaptive star grammars and their languages
Theoretical Computer Science
| Hi-index | 0.00 |
In model-driven design, the structure of software is commonly specified by meta-models like uml class diagrams. In this paper we study how graph grammars can be used for this purpose, using statecharts as an example. We extend context-free hyperedge-replacement--which is not powerful enough for this application--so that rules may not only access the nodes attached to the variable on their left-hand side, but also nodes elsewhere in the graph. Although the resulting notion of contextual hyperedge replacement preserves many properties of the context-free case, it has considerably more generative power--enough to specify software models that cannot be specified by class diagrams.