Model Transformation Reuse: A Graph-based Model Typing Approach
Texte intégral
Documents relatifs
In this paper, we classify reuse approaches for MTs across different metamodels and compare a sample of specific approaches – model types, concepts, a-posteriori typing,
L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des
L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des
This choice is motivated by the fact that both mechanisms address the same technical scope - the reuse of graph-based model transformations [7] - while contrasting in the employed
The translation to T MM described above can be used to give a semantics for in-place QVT-R specifications, but with a fixed-point execution model: the computationStep of a Mapping
In our orchestration prototype, the result of the transformation is returned and explored (i.e., using a visitor pattern) using the native method calls specific to the returned
More specic notions of typing have initially been introduced in relation to transformation composition, in particular, to external composition or chaining where
We propose to back-propagate test objectives along the chain into constraints and test models in the input language, relying on precondition construction in the theory of