Exploiting the Versatility of Constraint Programming over Finite Domains to Integrate Product Line Models. (Poster)

Camille Salinesi 1 Daniel Diaz 1 Olfa Djebbi 1 Raul Mazo 1 Colette Rolland 1
1 CRI - Centre de Recherche en Informatique de Paris 1
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.
Document type :
Conference papers
Complete list of metadatas
https://hal-paris1.archives-ouvertes.fr/hal-00663346
Contributor : Camille Salinesi <>
Submitted on : Thursday, January 26, 2012 - 5:15:04 PM
Last modification on : Friday, September 27, 2019 - 12:16:04 PM

Identifiers

Collections

CRI | UNIV-PARIS1

Citation

Camille Salinesi, Daniel Diaz, Olfa Djebbi, Raul Mazo, Colette Rolland. Exploiting the Versatility of Constraint Programming over Finite Domains to Integrate Product Line Models. (Poster). 17th IEEE International Requirements Engineering Conference, 2009. RE '09., Aug 2009, Atlanta, United States. pp.375-376, ⟨10.1109/RE.2009.52⟩. ⟨hal-00663346⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

91

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD