Co-transformation of Graphs and Type Graphs with Application to Model Co-evolution

Taentzer, Gabriele; Mantz, Florian; Lamo, Yngve

doi:10.1007/978-3-642-33654-6_22

Cited by 17 publications

(7 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The interested reader can find the formal definitions of these concepts in [30,21,20]. Graph transformation is the rule-based manipulation of graphs.…”

Section: Co-transformationsmentioning

confidence: 99%

“…It is possible to reverse this order which seems to better fit the needs of model co-evolution. By first adding new meta-model elements while keeping the ones to be deleted, the intermediate meta-model can be used for both, continuous typing of migrating models as well as synchronizing required migration changes (see also [30,22]). Meta-model elements that should be deleted, are removed in the second step.…”

Section: Co-transformationsmentioning

confidence: 99%

See 1 more Smart Citation

Customizing model migrations by rule schemes

Mantz¹,

Taentzer

Lamo³

2013

Proceedings of the 2013 International Workshop on Principles of Software Evolution

Self Cite

View full text Add to dashboard Cite

Model-driven engineering (MDE) is a software engineering discipline focusing on models as the primary artifacts in the software development process while programs are mainly generated by means of model-to-code transformations. In particular, modeling languages tailored to specific application domains promise to increase the productivity and quality of software development. Nevertheless due to e.g. evolving requirements, modeling languages and their meta-models evolve which means that existing models have to be migrated correspondingly. In our approach, such co-evolutions are specified as related graph transformations ensuring welltyped model migration results. Based on our earlier work on co-transformations, we now consider the automatic deduction of migration rule schemes from given meta-model evolution rules. Rule schemes form the basis for user customizations on a high abstraction level. A rule scheme deduction algorithm is presented and several customized migration schemes for different co-evolution examples are discussed.

show abstract

“…The interested reader can find the formal definitions of these concepts in [30,21,20]. Graph transformation is the rule-based manipulation of graphs.…”

Section: Co-transformationsmentioning

confidence: 99%

Section: Co-transformationsmentioning

confidence: 99%

Customizing model migrations by rule schemes

Mantz¹,

Taentzer

Lamo³

2013

Proceedings of the 2013 International Workshop on Principles of Software Evolution

Self Cite

View full text Add to dashboard Cite

show abstract

“…Years Implementation Approaches to generate resolution strategies: de Geest et al [10] 2008 claim Garcés et al [11], [12] 2008-2009 claim Meyers et al [13] 2012 no Mantz & Taentzeret al [14], [15], [16], [17], [18], [19] 2012-2013 no…”

Section: Approachesmentioning

confidence: 99%

Surveying the Corpus of Model Resolution Strategies for Metamodel Evolution

Hebig

Khelladi

Bendraou

2015

2015 Asia-Pacific Software Engineering Conference (APSEC)

View full text Add to dashboard Cite

Modeling languages evolve regularly. Companies need to maintain all those models that are used in running projects, which can cause these projects to fall back in their schedules. Since 10 years research addresses this issue with approaches for automating co-evolution. The dominant core of these approaches are model resolution strategies. They define 1) how models have to be changed in reaction to specific metamodel changes, 2) what degree of automation can be reached, and 3) to what extent the user can control the resolution outcome. In this paper, we survey existing co-evolution approaches and analyze model resolution strategies. We present a corpus of more than 200 resolution strategies for 116 types of metamodel changes and discuss degree of automation and choices that users have today.

show abstract

“…Then, model co-evolution is specified by GT rules which add or update elements according to the revised meta-model, and a check-out transformation eliminates the elements which are no longer in the revised meta-model. Also in the context of meta-model/model co-evolution, the work presented in [35] describes meta-model evolutions as co-span rules at the meta-model level, and provide a construction to derive co-span migration rules to transform instances of the original meta-model to the revised one.…”

Section: Related Workmentioning

confidence: 99%

Towards the flexible reuse of model transformations: A formal approach based on graph transformation

Lara

Guerra

2014

Journal of Logical and Algebraic Methods in Programming

View full text Add to dashboard Cite

Esta es la versión de autor del artículo publicado en: This is an author produced version of a paper published in:Journal of Logical and Algebraic Methods in Programming 83. 5-6 (2014) AbstractModel transformations are the heart and soul of Model Driven Engineering (MDE). However, in order to increase the adoption of MDE by industry, techniques for developing model transformations in the large and raising the quality and productivity in their construction, like reusability, are still needed.In previous works, we developed a reutilization approach for graph transformations based on the definition of concepts, which gather the structural requirements needed by meta-models to qualify for the transformations. Reusable transformations are typed by concepts, becoming transformation templates. Transformation templates are instantiated by binding the concept to a concrete meta-model, inducing a retyping of the transformation for the given meta-model. This paper extends the approach allowing heterogeneities between the concept and the metamodel, thus increasing the reuse opportunities of transformation templates. Heterogeneities are resolved by using algebraic adapters which induce both a retyping and an adaptation of the transformation. As an alternative, the adapters can also be employed to induce an adaptation of the meta-model, and in this work we show the conditions for equivalence of both approaches to transformation reuse.

show abstract

Co-transformation of Graphs and Type Graphs with Application to Model Co-evolution

Cited by 17 publications

References 15 publications

Customizing model migrations by rule schemes

Customizing model migrations by rule schemes

Surveying the Corpus of Model Resolution Strategies for Metamodel Evolution

Towards the flexible reuse of model transformations: A formal approach based on graph transformation

Contact Info

Product

Resources

About