Name
Abstract | ||
|---|---|---|
Analyzing software product lines is difficult, due to their inherent variability. In the past, several strategies for product-line analysis have been proposed, in particular, product-based, feature-based, and family-based strategies. Despite recent attempts to conceptually and empirically compare different strategies, there is no work that empirically compares all of the three strategies in a controlled setting. We close this gap by extending a compiler for feature-oriented programming with support for product-based, feature-based, and family-based type checking. We present and discuss the results of a comparative performance evaluation that we conducted on a set of 12 feature-oriented, Java-based product lines. Most notably, we found that the family-based strategy is superior for all subject product lines: it is substantially faster, it detects all kinds of errors, and provides the most detailed information about them. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1145/2517208.2517213 | GPCE |
Keywords | Field | DocType |
product line analysis | Domain analysis,Programming language,Type checking,Computer science,Theoretical computer science,Compiler,Software,Feature based,Java,Feature-oriented programming | Conference |
Volume | Issue | ISSN |
49 | 3 | 0362-1340 |
Citations | PageRank | References |
7 | 0.42 | 28 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sergiy Kolesnikov | 1 | 233 | 9.21 |
| Alexander von Rhein | 2 | 316 | 11.35 |
| Claus Hunsen | 3 | 53 | 3.52 |
| Sven Apel | 4 | 3980 | 184.13 |