Title :
Exploiting the Versatility of Constraint Programming over Finite Domains to Integrate Product Line Models
Author :
Salinesi, Camille ; Diaz, Daniel ; Djebbi, Olfa ; Mazo, Raul ; Rolland, Colette
Author_Institution :
Univ. Paris 1, Pantehon-Sorbonne, France
fDate :
Aug. 31 2009-Sept. 4 2009
Abstract :
Constraint Programming (CP), and in particular boolean CP, has been used so far to support analysis of variability models such as Feature Oriented Domain Analysis (FODA) and like. This paper goes a step further by using constraint programming to specify the Product Line (PL). The vision of variability and variation points completely disappear, and the focus is completely on constraints. Of course, the constraints can originate from various PL models, which can still be used to guide product analysis. However, owing to the unique constraint program, the analysis of the different viewpoints represented by each of these models is achieved in an integrated way.
Keywords :
constraint handling; formal specification; product development; program diagnostics; software reusability; constraint programming versatility; finite domain; product analysis; product line model specification; variation point; Arithmetic; Error analysis; Logic; Proposals; Vehicles;
Conference_Titel :
Requirements Engineering Conference, 2009. RE '09. 17th IEEE International
Conference_Location :
Atlanta, GA
Print_ISBN :
978-0-7695-3761-0