A Landscape of Bidirectional Model Transformations

Stevens, Perdita

doi:10.1007/978-3-540-88643-3_10

Cited by 93 publications

(64 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…3), we now focus on alternative bidirectional languages that share and address similar challenges as TGGs but take fundamentally different strategies. As bidirectionality is a challenge in various application domains and communities, there exists a substantial number of different approaches, formalizations and tools [Ste08]. The lenses framework is of particular interest when compared to TGGs, as [HEO + 11] has shown that incremental TGGs can be viewed as an implementation of a delta-based framework for symmetric lenses.…”

Section: Related Work On Alternative Bidirectional Languagesmentioning

confidence: 99%

“…Unification has wide-reaching consequences including enabling a natural bootstrap and higher order transformations. Finally, TGGs served as an inspiration and basis for the standard OMG bidirectional transformation language QVT and can be regarded as a valid implementation thereof [Ste08].…”

Section: Related Work On Alternative Bidirectional Languagesmentioning

confidence: 99%

“…This is especially the case for bidirectional model transformation, where defining a precise semantics for the automatic manipulation and synchronization of models with a corresponding efficient tool support is quite challenging [CFH + 09]. Amongst the numerous bidirectional model transformation approaches surveyed in [Ste08], the concept of Triple Graph Grammars (TGGs) features not only solid formal foundations [EEE + 07, KLKS10] but also various tool implementations [GHL10,KRW04,KLKS10].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Bidirectional Model Transformation with Precedence Triple Graph Grammars

Lauder

Anjorin

Varró

et al. 2012

Modelling Foundations and Applications

View full text Add to dashboard Cite

Triple Graph Grammars (TGGs) are a rule-based technique with a formal background for specifying bidirectional model transformation. In practical scenarios, the unidirectional rules needed for the forward and backward transformations are automatically derived from the TGG rules in the specification, and the overall transformation process is governed by a control algorithm. Current implementations either have a worst case exponential runtime complexity or pose such strong restrictions on the class of supported TGGs that practical real-world applications become infeasible. This paper, therefore, introduces a new class of TGGs together with a control algorithm that drops a number of practice-relevant restrictions for TGG rules and still has a polynomial runtime complexity.

show abstract

Section: Related Work On Alternative Bidirectional Languagesmentioning

confidence: 99%

Section: Related Work On Alternative Bidirectional Languagesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Bidirectional Model Transformation with Precedence Triple Graph Grammars

Lauder

Anjorin

Varró

et al. 2012

Modelling Foundations and Applications

View full text Add to dashboard Cite

show abstract

“…Testing model transformations is not an easy task and present numerous challenges [1,2,3,4]. In the literature there are two main approaches to model transformation testing (see also Section 5).…”

Section: Introductionmentioning

confidence: 99%

Tractable Model Transformation Testing

Gogolla

Vallecillo

2011

Modelling Foundations and Applications

View full text Add to dashboard Cite

Abstract. Model transformation (MT) testing is gaining interest as the size and complexity of MTs grows. In general it is very difficult and expensive (time and computational complexity-wise) to validate in full the correctness of a MT. This paper presents a MT testing approach based on the concept of Tract, which is a generalization of the concept of Model Transformation Contract. A Tract defines a set of constraints on the source and target metamodels, a set of source-target constraints, and a tract test suite, i.e., a collection of source models satisfying the source constraints. We automatically generate input test suite models, which are then transformed into output models by the transformation under test, and the results checked with the USE tool (UML-based Specification Environment) against the constraints defined for the transformation. We show the different kinds of tests that can be conducted over a MT using this automated process, and the kinds of problems it can help uncovering.

show abstract

“…The papers follow on from earlier work by the present author, [10], in which questions answered here, specifically the role of relation invocation in when and where clauses (relation definition applied to particular arguments), were left open. Discussion of the foundations of, and range of approaches to, bidirectionality, not specific to QVT, are presented in [9] and [8] respectively.…”

Section: Introductionmentioning

confidence: 99%

A simple game-theoretic approach to checkonly QVT Relations

Stevens

2011

Softw Syst Model

Self Cite

View full text Add to dashboard Cite

The QVT Relations (QVT-R) transformation language allows the definition of bidirectional model transformations, which are required in cases where a two (or more) models must be kept consistent in the face of changes to either. A QVT-R transformation can be used either in checkonly mode, to determine whether a target model is consistent with a given source model, or in enforce mode, to change the target model. Although the most obvious semantic issues in the QVT standard concern the restoration of consistency, in fact even checkonly mode is not completely straightforward; this mode is the focus of this paper. We need to consider the overall structure of the transformation as given by when and where clauses, and the role of trace classes. In the standard, the semantics of QVT-R are given both directly, and by means of a translation to QVT Core, a language which is intended to be simpler. In this paper, we argue that there are irreconcilable differences between the intended semantics of QVT-R and those of QVT Core, so that the translation cannot be helpful. Treating QVT-R directly, we propose a simple game-theoretic semantics. We demonstrate its behaviour on examples and show how it can be used to compare QVT-R transformations. We demonstrate that consistent models may not possess a single trace model whose objects can be read as traceability links in either direction. We briefly discuss the effect of variations in the rules of the game, to elucidate some design choices available to the designers of the QVT-R language.

show abstract

A Landscape of Bidirectional Model Transformations

Cited by 93 publications

References 27 publications

Bidirectional Model Transformation with Precedence Triple Graph Grammars

Bidirectional Model Transformation with Precedence Triple Graph Grammars

Tractable Model Transformation Testing

A simple game-theoretic approach to checkonly QVT Relations

Contact Info

Product

Resources

About