Correctness, completeness and termination of pattern-based model-to-model transformation
Entity
UAM. Departamento de Ingeniería InformáticaPublisher
Springer Berlin HeidelbergDate
2009Citation
10.1007/978-3-642-03741-2_26
Algebra and Coalgebra in Computer Science: Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings. Lecture Notes in Computer Science, Volumen 5728. Springer, 2009. 383-397
ISSN
0302-9743 (print); 1611-3349 (online)ISBN
978-3-642-03740-5 (print); 978-3-642-03741-2 (online)DOI
10.1007/978-3-642-03741-2_26Funded by
Work supported by the Spanish Ministry of Science and Innovation, projects METEORIC (TIN2008-02081), MODUWEB (TIN2006-09678) and FORMALISM (TIN2007-66523). Moreover, part of this work was done during a sabbatical leave of the first author at TU Berlin, with financial support from the Spanish Ministry of Science and Innovation (grant ref. PR2008-0185). We thank the referees for their useful commentsEditor's Version
http://dx.doi.org/10.1007/978-3-642-03741-2_26Subjects
Logics and Meanings of Programs; Discrete Mathematics in Computer Science; Models and Principles; Computation by Abstract Devices; InformáticaNote
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-03741-2_26Proceedings of Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009.
Rights
© Springer-Verlag Berlin Heidelberg 2009Abstract
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.
Files in this item
Google Scholar:Orejas, Fernando
-
Guerra Sánchez, Esther
-
Lara Jaramillo, Juan de
-
Ehrig, Hartmut
This item appears in the following Collection(s)
Related items
Showing items related by title, author, creator and subject.