A relational approach to defining and implementing transformations between metamodels

Akehurst, David H.; Kent, Stuart; Patrascoiu, Octavian

doi:10.1007/s10270-003-0032-z

Cited by 44 publications

(48 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…TGGs are also used for generating transformations (e.g., the [11] tool), but without search capabilities. [2,10] also expore the notion of weaving relationships but do not use them as direct transformation specifications. However, the described patterns may be useful in our context as specifications templates.…”

Section: Related Workmentioning

confidence: 99%

Transformation as Search

Kleiner

Fabro

Santos

2013

Modelling Foundations and Applications

View full text Add to dashboard Cite

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.

show abstract

Section: Related Workmentioning

confidence: 99%

Transformation as Search

Kleiner

Fabro

Santos

2013

Modelling Foundations and Applications

View full text Add to dashboard Cite

show abstract

“…We can then use this I PCD to relate I CD and I RDBS by what we call a semantic connection. 2 Definition 3. A semantic connection between an institution I and another institution I is a pair (µ, ρ) of the form I µ I 0 ρ → I , where I 0 is a third institution, µ is an institution morphism, and ρ is an institution comorphism.…”

Section: Semantic Connectionsmentioning

confidence: 99%

“…In the model-driven architecture approach, the MOF standard permits the syntactical definition of modeling languages by means of the metamodel notion. The formal semantics of the MOF standard and its use for model transformations have been studied in algebraic [8], relational [2], graph grammar [5] and type-theoretic [27,28] settings. OCL-constraints of meta-models have been added in our algebraic setting in [7] and in the relational approach for Alloy in [3].…”

Section: Related Work and Conclusionmentioning

confidence: 99%

What Is a Multi-modeling Language?

Boronat

Knapp

Meseguer

et al. 2009

Recent Trends in Algebraic Development Techniques

View full text Add to dashboard Cite

Abstract. In large software projects often multiple modeling languages are used in order to cover the different domains and views of the application and the language skills of the developers appropriately. Such "multi-modeling" raises many methodological and semantical questions, ranging from semantic consistency of the models written in different sublanguages to the correctness of model transformations between the sublanguages. We provide a first formal basis for answering such questions by proposing semantically well-founded notions of a multimodeling language and of semantic correctness for model transformations. In our approach, a multi-modeling language consists of a set of sublanguages and correct model transformations between some of the sublanguages. The abstract syntax of the sublanguages is given by MOF meta-models. The semantics of a multi-modeling language is given by associating an institution, i.e., an appropriate logic, to each of its sublanguages. The correctness of model transformations is defined by semantic connections between the institutions.

show abstract

“…The QVT Partner's proposal [2] to the QVT RFP of the OMG [31] is a relational approach based on the UML and very similar to the work of Kent [1]. While Kent is using OCL constraints to define detailed rules, the QVT Partners propose a graphical definition of patterns and operational transformation rules.…”

Section: Other Approachesmentioning

confidence: 99%

“…1 For example, consider the transition from requirements to design, which involves moving from the problem space to the solution space. The design cannot be generated automatically from the requirements.…”

Section: Introductionmentioning

confidence: 99%

A graph-based algorithm for consistency maintenance in incremental and interactive integration tools

et al. 2007

View full text Add to dashboard Cite

Development processes in engineering disciplines are inherently complex. Throughout the development process, the system to be built is modeled from different perspectives, on different levels of abstraction, and with different intents. Since state-ofthe-art development processes are highly incremental and iterative, models of the system are not constructed in one shot; rather, they are extended and improved repeatedly. Furthermore, models are related by manifold dependencies and need to be maintained mutually consistent with respect to these dependencies. Thus, tools are urgently needed which assist developers in maintaining consistency between inter-dependent and evolving models. These tools have to operate incrementally, i.e., they have to propagate changes performed on one model into related models which are affected by these changes. In addition, they need to support user interactions in settings where the effects of changes cannot be determined automatically and deterministically. We present an algorithm for incremental and interactive consistency maintenance which meets these requirements. The algorithm is based on graphs, which are used as the data model for representing the models to be integrated, and graph transformation rules, which describe the modifications of the graphs to be performed on a high level of abstraction.

show abstract

A relational approach to defining and implementing transformations between metamodels

Cited by 44 publications

References 22 publications

Transformation as Search

Transformation as Search

What Is a Multi-modeling Language?

A graph-based algorithm for consistency maintenance in incremental and interactive integration tools

Contact Info

Product

Resources

About