Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6871054 | Computer Languages, Systems & Structures | 2015 | 23 Pages |
Abstract
In this paper, we propose a new approach to model transformation development which allows to simplify the developed transformations and improve their quality via the exploitation of the languages׳ structures. The approach is based on context-free graph grammars and transformations defined by pairing productions of source and target grammars. We show that such transformations have important properties: they terminate and are sound, complete, and deterministic.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Galina Besova, Dominik Steenken, Heike Wehrheim,