Transformation as Search

Abstract

is an open access repository that collects the work of Arts et Métiers ParisTech researchers and makes it freely available over the web where possible. Abstract. In model-driven engineering, model transformations are considered a key element to generate and maintain consistency between related models. Rule-based approaches have become a mature technology and are widely used in different application domains. However, in various scenarios, these solutions still suffer from a number of limitations that stem from their injective and deterministic nature. This article proposes an original approach, based on non-deterministic constraint-based search engines, to define and execute bidirectional model transformations and synchronizations from single specifications. Since these solely rely on basic existing modeling concepts, it does not require the introduction of a dedicated language. We first describe and formally define this model operation, called transformation as search, then describe a proof-of-concept implementation and discuss experiments on a reference use case in software engineering.

Coupling solvers with model transformations to generate explorable model sets

“…In [22], an approach is proposed to fully integrate constraint programming into existing MDE workflows. This approach is used in [23] to build bidirectional transformations. In [12], authors present another approach using Answer Set Programming to enable bidirectional model transformation.…”

Declarative Specification of Bidirectional Transformations Using Design Patterns

“…• Auxiliary Correspondence Model: using auxiliary entity types or features, maintain an explicit correspondence between source model and target model elements to facilitate change-propagation in source to target or target to source directions (Figure 3). This pattern is a built-in mechanism of the TGG language and has been used in numerous transformation cases [3], [16], [17], [21], [22], [24], [25], [27], [29], [32], [41], [55], [58], [67]. In QVT-R there are implicit trace entities for each relation [51].…”

A survey of model transformation design patterns in practice

“…In contrast to [156] we use the terms Refactoring and Bidirectional as these are more commonly used in the MT community than the terms Editing and Model synchronisation. Our main difference to [156] is that cases of a PIM to PSM mapping (such as the class diagram to relational database example [119]) are considered as refinements, not translations. Likewise, mappings that map from a semi-formal to a formal language (eg., [212]) are usually considered semantic mappings, not translations.…”