Search-based model transformation by example |
| |
Authors: | Marouane Kessentini Houari Sahraoui Mounir Boukadoum Omar Ben Omar |
| |
Affiliation: | 1. D??partement d??Informatique et Recherche Op??rationnelle, Universit?? de Montr??al, CP 6128, succ Centre-Ville, Montr??al, QC, H3C 3J7, Canada 2. D??partement d??Informatique, Universit?? du Qu??bec??? Montr??al, CP 8888, succ Centre-ville, Montr??al, QC, H3C 3P, Canada
|
| |
Abstract: | Model transformation (MT) has become an important concern in software engineering. In addition to its role in model-driven
development, it is useful in many other situations such as measurement, refactoring, and test-case generation. Roughly speaking,
MT aims to derive a target model from a source model by following some rules or principles. So far, the contributions in MT
have mostly relied on defining languages to express transformation rules. However, the task of defining, expressing, and maintaining
these rules can be difficult, especially for proprietary and non-widely used formalisms. In some situations, companies have
accumulated examples from past experiences. Our work starts from these observations to view the transformation problem as
one to solve with fragmentary knowledge, i.e. with only examples of source-to-target MTs. Our approach has two main advantages:
(1) it always proposes a transformation for a source model, even when rule induction is impossible or difficult to achieve;
(2) it is independent from the source and target formalisms; aside from the examples, no extra information is needed. In this
context, we propose an optimization-based approach that consists of finding in the examples combinations of transformation
fragments that best cover the source model. To that end, we use two strategies based on two search-based algorithms: particle
swarm optimization and simulated annealing. The results of validating our approach on industrial projects show that the obtained
models are accurate. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|