Solving constraints in model transformations

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

Abstract

Constraint programming holds many promises for model driven software development (MDSD). Up to now, constraints have only started to appear in MDSD modeling languages, but have not been properly reflected in model transformation. This paper introduces constraint programming in model transformation, shows how constraint programming integrates with QVT Relations - as a pathway to wide spread use of our approach - and describes the corresponding model transformation engine. In particular, the paper will illustrate the use of constraint programming for the specification of attribute values in target models, and provide a qualitative evaluation of the benefit drawn from constraints integrated with QVT Relations. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Petter, A., Behring, A., & Mühlhäuser, M. (2009). Solving constraints in model transformations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5563 LNCS, pp. 132–147). https://doi.org/10.1007/978-3-642-02408-5_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