Specification and verification of graph-based model transformation properties

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

Abstract

We extend a previously proposed symbolic model transformation property prover for the DSLTrans transformation language. The original prover generated the set of path conditions (i.e., symbolic transformation executions), and verified atomic contracts (constraints on input-output model relations) on these path conditions. The prover evaluated atomic contracts to yield either true or false for the transformation when run on any input model. In this paper we extend the prover such that it can verify atomic contracts and more complex properties composed of atomic contracts. Besides demonstrating our prover on a simple transformation, we use it to verify different kinds of properties of an industrial transformation. Experiments on this transformation using our prover show a speed-up in verification run-time by two orders of magnitude over another verification tool that we evaluated in previous research. © 2014 Springer International Publishing Switzerland.

Cite

CITATION STYLE

APA

Selim, G. M. K., Lúcio, L., Cordy, J. R., Dingel, J., & Oakes, B. J. (2014). Specification and verification of graph-based model transformation properties. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8571 LNCS, pp. 113–129). Springer Verlag. https://doi.org/10.1007/978-3-319-09108-2_8

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