Formal foundation of consistent EMF model transformations by algebraic graph transformation

Abstract

Model transformation is one of the key activities in model-driven software development. An increasingly popular technology to define modeling languages is provided by the Eclipse Modeling Framework (EMF). Several EMF model transformation approaches have been developed, focusing on different transformation aspects. To validate model transformations with respect to functional behavior and correctness, a formal foundation is needed. In this paper, we define consistent EMF model transformations as a restricted class of typed graph transformations using node type inheritance. Containment constraints of EMF model transformations are translated to a special kind of graph transformation rules such that their application leads to consistent transformation results only. Thus, consistent EMF model transformations behave like algebraic graph transformations and the rich theory of algebraic graph transformation can be applied to these EMF model transformations to show functional behavior and correctness. Furthermore, we propose parallel graph transformation as a suitable framework for modeling EMF model transformations with multi-object structures. Rules extended by multi-object structures can specify a flexible number of recurring structures. The actual number of recurring structures is dependent on the application context of such a rule. We illustrate our approach by selected refactorings of simplified statechart models. Finally, we discuss the implementation of our concepts in a tool environment for EMF model transformations.

VMTL: a language for end-user model transformation

“…In such cases, the underlying MT engine can support the VMTL transformation developer by formally analyzing specifications. The Henshin engine supports critical pair analysis, a technique originating in graph transformation theory [14]. However, this technique has limitations: the termination of a graph transformation system is undecidable in the general case.…”

Translating ATL Model Transformations to Algebraic Graph Transformations

“…We will be using the Henshin [2] graph transformation framework which applies the theoretical semantics to standard EMF models in the Eclipse platform. The details of the formal foundations of Henshin can be found in [5] and are only briefly recalled here. A graph transformation is composed of two main elements: a set of transformation rules, and a high-level program defining the sequencing of rules.…”

“…Our prototype was successfully validated with the transformations listed in Table 3. Simulink CodeGen is a simplified version of an industrial Simulink to C code generator 5 . Note that in Families2Persons, the high number of resolving rules (relative to only 2 bindings) is due to the translation scheme of nested if-then-else binding queries which has not been developed in this paper.…”

Co-evolving meta-models and their instance models: A formal approach based on graph transformation

“…Graph transformations [4,5] are well-established means to formally underpin model transformations. Moreover, the theory of graph transformations has been lifted to high-level structures, not necessarily being graphs [4].…”