Toward Bidirectionalization of ATL with GRoundTram

Sasano, Isao; Hu, Zhenjiang; Hidaka, Soichiro; Inaba, Kazuhiro; Kato, Hirokazu; Nakano, Kazushi

doi:10.1007/978-3-642-21732-6_10

Cited by 16 publications

(14 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the advantages of our declarative approach can be leveraged in conjunction with special (often more declarative) transformation languages for bidirectional model transformations. Therefore, our approach should benefit from ongoing research in that area [19,3,14].…”

Section: Discussionmentioning

confidence: 99%

Refactorings in Language Development with Asymmetric Bidirectional Model Transformations

Schmidt

Wider

Scheidgen

et al. 2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Software language descriptions comprise several heterogeneous interdependent artifacts that cover different aspects of languages (abstract syntax, notation and semantics). The dependencies between those artifacts demand the simultaneous adaptation of all artifacts when the language is changed. Changes to a language that do not change semantics are referred to as refactorings. This class of changes can be handled automatically by applying predefined types of refactorings. Refactorings are therefore considered a valuable tool for evolving a language. We present a model transformation based approach for the refactoring of software language descriptions. We use asymmetric bidirectional model transformations to synchronize the various artifacts of language descriptions with a refactoring model that contains all elements that are changed in a particular refactoring. This allows for automatic, type-safe refactorings that also includes the language tooling. We apply this approach to an Ecore, Xtext, Xtend based language description and describe the implementation of a non-trivial refactoring.

show abstract

Section: Discussionmentioning

confidence: 99%

Refactorings in Language Development with Asymmetric Bidirectional Model Transformations

Schmidt

Wider

Scheidgen

et al. 2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Initial work provides an unidirectional transformation from ATL to UnQL + , whereby the transformation does not take the model representation of ATL into account (Sasano et al, 2011) 2 . Thus, language-specific bindings for, for instance, ATL and/or ETL to UnQL + and/or UnCAL via B-HOT is future work.…”

Section: B-hot Requirementsmentioning

confidence: 99%

“…• A method for MDD-based co-evolution: Our approach of bidirectional higher-order transformation (B-HOT) for the co-evolution of model artifacts builds on former work (Hidaka et al, 2009;Hidaka et al, 2011;Sasano et al, 2011;Hoisl et al, 2013). This paper presents first enhancement steps which will allow for coupling, synchronization, and tracing of all model artifacts involved in a MDD process.…”

Section: Introductionmentioning

confidence: 99%

Towards Co-evolution in Model-Driven Development Via Bidirectional Higher-Order Transformation

Hoisl¹,

Hidaka

2014

Proceedings of the 2nd International Conference on Model-Driven Engineering and Software Development

View full text Add to dashboard Cite

Abstract:In model-driven development (MDD), metamodels, models, and model transformations are interdependent. A change in one artifact must be reflected in all other related artifacts. Regardless of their dependencies, (meta)models and transformations can evolve autonomously rendering referenced artifacts invalid. Coupling the evolution of models to their corresponding metamodels tries to prevent such mismatches, but is currently limited to one-way adaptations and does not take model transformations into account. To eliminate these shortcomings, we combine first-class transformation models with bidirectional transformations (BX). Our generic approach integrates BX into well-established Eclipse-based MDD tools, thereby neither being restricted to a specific modeling nor model transformation language.

show abstract

“…Then the bulk semantics makes it easier to prove the finiteness-preservation and termination properties. UnCAL is used also as a basis for bidirectional graph transformation [15] and for model driven software engineering [27].…”

Section: Introductionmentioning

confidence: 99%

A parameterized graph transformation calculus for finite graphs with monadic branches

Asada

Hidaka

Kato

et al. 2013

Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming

Self Cite

View full text Add to dashboard Cite

We introduce a lambda calculus λ T FG for transformations of finite graphs by generalizing and extending an existing calculus UnCAL. Whereas UnCAL can treat only unordered graphs, λ T FG can treat a variety of graph models: directed edge-labeled graphs whose branch styles are represented by monads T . For example, λ T FG can treat unordered graphs, ordered graphs, weighted graphs, probability graphs, and so on, by using the powerset monad, list monad, multiset monad, probability monad, respectively. In λ T FG , graphs are considered as extension of tree data structures, i.e. as infinite (regular) trees, so the semantics is given with bisimilarity.A remarkable feature of UnCAL and λ T FG is structural recursion for graphs, which gives a systematic programming basis like that for trees. Despite the non-well-foundedness of graphs, by suitably restricting the structural recursion, UnCAL and λ T FG ensures that there is a termination property and that all transformations preserve the finiteness of the graphs. The structural recursion is defined in a "divide-and-aggregate" way; "aggregation" is done by connecting graphs with ε-edges, which are similar to the ε-transitions of automata. We give a suitable general definition of bisimilarity, taking account of ε-edges; then we show that the structural recursion is well defined with respect to the bisimilarity.

show abstract

Toward Bidirectionalization of ATL with GRoundTram

Cited by 16 publications

References 19 publications

Refactorings in Language Development with Asymmetric Bidirectional Model Transformations

Refactorings in Language Development with Asymmetric Bidirectional Model Transformations

Towards Co-evolution in Model-Driven Development Via Bidirectional Higher-Order Transformation

A parameterized graph transformation calculus for finite graphs with monadic branches

Contact Info

Product

Resources

About