Correctness, Completeness and Termination of Pattern-Based Model-to-Model Transformation

Abstract. Model-to-model (M2M) transformation consists in transforming 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.

• Type: Conference
• Year: 2009
• Where: CALCO
• Authors: Fernando Orejas, Esther Guerra, Juan de Lara, Hartmut Ehrig
• Keywords: CALCO 2009, M2M Transformation, Many Transformation Languages, Mathematics, Pattern-based Transformation