Handbook of formal languages, vol. 3
The PROGRES approach: language and environment
Handbook of graph grammars and computing by graph transformation
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)
Formalising Behaviour Preserving Program Transformations
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Generation of visual editors as eclipse plug-ins
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
A graph transformation approach to refactoring
A graph transformation approach to refactoring
Overview of Formal Concepts for Model Transformations Based on Typed Attributed Graph Transformation
Electronic Notes in Theoretical Computer Science (ENTCS)
On translating UML models into graph transformation systems
Journal of Visual Languages and Computing
ICGT'06 Proceedings of the Third international conference on Graph Transformations
MOFLON: a standard-compliant metamodeling framework with graph transformations
ECMDA-FA'06 Proceedings of the Second European conference on Model Driven Architecture: foundations and Applications
Shaped Generic Graph Transformation
Applications of Graph Transformations with Industrial Relevance
| Hi-index | 0.00 |
Adaptive star grammars generalize well-known graph grammar formalisms based on hyperedge and node replacement while retaining, e.g., parseability and the commutativity and associativity of rule application. In this paper, we study how these grammars can be put to practical use for the definition of graph models. We show how to use adaptive star grammars to specify program graphs, models of object-oriented programs that have been devised for investigating refactoring operations. For this, we introduce notational enhancements and one proper extension (application conditions). The program graphs generated by the grammar comprise not only the nested composition of entities, but also scope rules for their declarations. Such properties cannot easily be defined by meta-models like Umlclass diagrams. In contrast, adaptive star grammars cover several aspects of class diagrams.