Open AccessUsing triple graph grammars to realise incremental round‐trip engineering
Author(s) -
Buchmann Thomas,
Westfechtel Bernhard
Publication year - 2016
Publication title -
iet software
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.305
H-Index - 43
eISSN - 1751-8814
pISSN - 1751-8806
DOI - 10.1049/iet-sen.2015.0125
Subject(s) - rule based machine translation , computer science , graph , programming language , theoretical computer science , artificial intelligence
Model‐driven software engineering is supported with the help of model transformations. At present, the technology for defining and executing uni‐directional batch transformations seems to be fairly well developed, while bidirectional and incremental transformations are more difficult to handle. In this study, the authors present a bidirectional and incremental transformation tool for round‐trip engineering between class diagrams and Java source code. Unlike other approaches, the tool may work with arbitrary Java code rather than only with source code following specific coding conventions. For its realisation, they selected triple graph grammars (TGGs) because they allow to generate bidirectional incremental transformations from a single set of undirected rules. When applying TGGs, they observed several strengths and weaknesses which are also discussed in this study.