Checking Model Transformation Refinement

12Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Refinement is a central notion in computer science, meaning that some artefact S can be safely replaced by a refinement R, which preserves S's properties. Having available techniques and tools to check transformation refinement would enable (a) the reasoning on whether a transformation correctly implements some requirements, (b) whether a transformation implementation can be safely replaced by another one (e.g. when migrating from QVT-R to ATL), and (c) bring techniques from stepwise refinement for the engineering of model transformations. In this paper, we propose an automated methodology and tool support to check transformation refinement. Our procedure admits heterogeneous specification (e.g. PaMoMo, Tracts, OCL) and implementation languages (e.g. ATL, QVT), relying on their translation to OCL as a common representation formalism and on the use of model finding tools. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Büttner, F., Egea, M., Guerra, E., & De Lara, J. (2013). Checking Model Transformation Refinement. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7909 LNCS, pp. 158–173). https://doi.org/10.1007/978-3-642-38883-5_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free