Correctness, completeness and termination of pattern-based model-to-model transformation

  • Authors:
  • Fernando Orejas;Esther Guerra;Juan De Lara;Hartmut Ehrig

  • Affiliations:
  • Universitat Politècnica de Catalunya, Spain;Universidad Carlos III de Madrid, Spain;Universidad Autónoma de Madrid, Spain;Technische Universität Berlin, Germany

  • Venue:
  • CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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.