A technique for automatic validation of model transformations

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

Abstract

We present in this paper a technique for proving properties about model transformations. The properties we are concerned about relate the structure of an input model with the structure of the transformed model. The main highlight of our approach is that we are able to prove the properties for all models, i.e. the transformation designer may be certain about the structural soundness of the results of his/her transformations. In order to achieve this we have designed and experimented with a transformation model checker, which builds what we call a state space for a transformation. That state space is then used as in classical model checking to prove the property or, in case the property does not hold to produce a counterexample. If the property holds this information can be used as a certification for the transformation, otherwise the counterexample can be used as debug information during the transformation design process. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Lúcio, L., Barroca, B., & Amaral, V. (2010). A technique for automatic validation of model transformations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6394 LNCS, pp. 136–150). https://doi.org/10.1007/978-3-642-16145-2_10

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