Exploiting the Versatility of Constraint Programming over Finite Domains to Integrate Product Line Models. (Poster) - Université Paris 1 Panthéon-Sorbonne Access content directly
Conference Papers Year : 2009

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

Daniel Diaz
Olfa Djebbi
  • Function : Author
  • PersonId : 843247
  • IdRef : 15782599X
Raul Mazo
Colette Rolland
  • Function : Author
  • PersonId : 864300
  • IdRef : 027106683

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.
No file

Dates and versions

hal-00663346 , version 1 (26-01-2012)

Identifiers

Cite

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⟩

Collections

UNIV-PARIS1 CRI
67 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More