Abstract
Since the systematic evolution of graph-like program models has become important in software engineering, graph transformation has gained much attention in this area. For specifying model evolution concisely, graph transformation rules should be as expressive as possible. The generic rules proposed in this paper may contain placeholders for graphs of varying number and shape. Expansion of these placeholders by graphs yields the actual transformation rules to be applied. Even rather complex transformations occurring in real-life applications, such as the Pull-Up-Method refactoring operation, can be specified by a single generic rule. © 2008 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Drewes, F., Hoffmann, B., Janssens, D., Minas, M., & Van Eetvelde, N. (2008). Shaped generic graph transformation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5088 LNCS, pp. 201–216). Springer Verlag. https://doi.org/10.1007/978-3-540-89020-1_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
