An Example of Cloning Graph Transformation Rules for Programming

Authors:
Mark Minas;Berthold Hoffmann
Affiliations:
Universität der Bundeswehr München, 85577 Neubiberg, Germany;Technologiezentrum Informatik, Universität Bremen, 28334 Bremen, Germany
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 5
Cited 2

Graph transformation for specification and programming

Science of Computer Programming
The PROGRES approach: language and environment

Handbook of graph grammars and computing by graph transformation
Story Diagrams: A New Graph Rewrite Language Based on the Unified Modeling Language and Java

TAGT'98 Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations
Flattening statecharts without explosions

Proceedings of the 2004 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
Rule-Based Programming with Diaplan

Electronic Notes in Theoretical Computer Science (ENTCS)

A Collection Operator for Graph Transformation

ICMT '09 Proceedings of the 2nd International Conference on Theory and Practice of Model Transformations
A collection operator for graph transformation

Software and Systems Modeling (SoSyM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Graphical notations are already popular for the design of software, as witnessed by the success of the Uniform Modeling Languages (UML). In this paper, we advocate the use of graphs and graph transformation for programming graph-based systems. Our case study, the flattening of hierarchical statecharts, reveals that cloning, a recently proposed transformation concept, makes graph transformation rules (in the double-pushout approach) more expressive. Thus programming becomes easier, and gets along with simpler control conditions in particular.