Towards a time-efficient algorithm to calculate the total number of products of a Software Product Line: Completed Research

1st International Workshop on Domain Engineering

Ruben Heradio Gil ; David Fernandez Amoros

Others  :  http://CEUR-WS.org/Vol-457/paper5.pdf
PID  :  4551

来源: CEUR

【 摘 要 】

Feature Diagrams (FDs) are widely used to scope the domain of Software Product Lines (SPLs). In addition, valuable information can be inferred from FDs; for instance, the total number of possible products of a SPL. A common approach to calculate the number of products is translating FDs into propositional logic formulas, which are processed by off-the-shelf tools, such as SAT solvers. However, this approach only works for small FDs. We think more scalable solutions can be reached avoiding the diagram-to-logic transformation and taking advantage of the tree organization of FDs. Due to the profusion of feature modeling notations, this paper formally defines a pivot language, named Neutral Feature Tree (NFT), where FDs are restricted to be trees. Most popular FD notations can be easily and efficiently translated to NFT. The paper also proposes a general and time-efficient algorithm to calculate the number of products without considering crosstree constraints.