Automated Reasoning for Derivation of Model-Driven SPLs

International audienceModel-Driven SPL approaches use metamodels and transformation rules to obtain concrete software artifacts departing from models. Most of such approaches use also feature models to express variability. Because of the variability, to derive products, they have to adapt the transformation rules according to user choices captured in feature configurations. In this paper we propose an approach based on Constraint Programming to derive Model-Driven SPLs. Our contribution is twofold. First, we assist product line architects when relating transformation rules and features in order to derive prod- ucts based on feature configurations; the novelty is that we facilitate the management of feature interactions to architects. Second, current approaches to reason on feature models in SPL Engineering only deal with problems related to product configuration. We improve such approaches adding facilities for product derivation