Improving Product Line Engineering Based on the Versatility of Constraint Programming over Finite Domains - Université Paris 1 Panthéon-Sorbonne Access content directly
Reports Year : 2009

Improving Product Line Engineering Based on the Versatility of Constraint Programming over Finite Domains

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-00663522 , version 1 (27-01-2012)

Identifiers

  • HAL Id : hal-00663522 , version 1

Cite

Camille Salinesi, Daniel Diaz, Olfa Djebbi, Colette Rolland. Improving Product Line Engineering Based on the Versatility of Constraint Programming over Finite Domains. 2009. ⟨hal-00663522⟩
68 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More