Model-to-model (M2M) transformation consists in trans- forming models from a source to a target language. Many transformation languages exist, but few of them combine a declarative and relational style with a formal underpinning able to show properties of the transformation. Pattern-based transformation is an algebraic, bidirectional, and relational approach to M2M transformation. Specifications are made of patterns stating the allowed or forbidden relations between source and target models, and then compiled into low level operational mechanisms to perform source-to-target or target-to-source transformations. In this paper, we study the compilation into operational triple graph grammar rules and show: (i) correctness of the compilation of a specification without negative patterns; (ii) termination of the rules, and (iii) completeness, in the sense that every model considered relevant can be built by the rules. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Orejas, F., Guerra, E., De Lara, J., & Ehrig, H. (2009). Correctness, completeness and termination of pattern-based model-to-model transformation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5728 LNCS, pp. 383–397). https://doi.org/10.1007/978-3-642-03741-2_26
Mendeley helps you to discover research relevant for your work.