Sans constraints? Feature diagrams vs. feature models

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6287 LNCS, Issue , 2010, Pages 271-285

  Gil, Yossi ^a   Kremer Davidson, Shiri ^a   Maman, Itay ^a  

^a IBM RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC COMPLEXITY; CIRCUIT COMPLEXITY; EXPONENTIAL INCREASE; FEATURE DIAGRAMS; FEATURE EDITING; FEATURE MODELS; GRAPH ALGORITHMS; INTER-DEPENDENCIES; SOFTWARE PRODUCT LINE; TREE SIZE;

SOFTWARE DESIGN;

EID: 78049395531     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15579-6_19     Document Type: Conference Paper

References (23)

1. Alon, N., Boppana, R. B.: The monotone circuit complexity of boolean functions. Combinatorica (1987)
2. Batory, D.: Feature models, grammars, and propositional formulas. In: Obbink, H., Pohl, K. (eds.) SPLC 2005. LNCS, vol. 3714, pp. 7-20. Springer, Heidelberg (2005)
3. Czarnecki, K., Helsen, S., Eisenecker, U. W.: Formalizing cardinality-based feature models and their specialization. Software Process: Improvement and Practice (2005)
4. Czarnecki, K., Wasowski, A.: Feature diagrams and logics: There and back again. In: SPLC 2007 (2007)
5. Gilbert, E. N.: Lattice theoretic properties of frontal switching functions. J. Math. Phys. (1954)
6. Golumbic, M. C., Mintz, A., Rotics, U.: An improvement on the complexity of factoring read-once boolean functions. Discrete Applied Mathematics (2008)
7. Heymans, P., Schobbens, P.-Y., Trigaux, J.-C., Bontemps, Y., Matulevicius, R., Classen, A.: Evaluating formal properties of feature diagram languages. IET Software (2008)
8. Kaltofen, E.: Factorization of polynomials given by straight-line programs. In: Randomness and Computation, pp. 375-412. JAI Press, Greenwich (1989)
9. Kang, K., Cohen, S., Hess, J., Nowak, W., Peterson, S.: Feature-oriented domain analysis (FODA) feasibility study. Technical report, CMU/SEI-90TR-21 (1990)
10. Karchmer, M., Linial, N., Newman, I., Saks, M., Wigderson, A.: Combinatorial characterization of read once formulae. J. Discrete Math. (1993)
11. Karchmer, M., Wigderson, A.: Monotone circuits for connectivity require superlogarithmic depth. SIAM J. Discrete Math. (1990)
12. McGeer, P. C., Brayton, R. K.: Efficient prime factorization of logic expressions. In: DAC 1989 (1989)
13. Meinel, C., Theobald, T.: Algorithms and Data Structures in VLSI Design. Springer, New York (1998)
14. Mendonca, M., Wasowski, A., Czarnecki, K.: Sat-based analysis of feature models is easy. In: SPLC 2009 (2009)
15. Newman, I., Wigderson, A.: Lower bounds on formula size of boolean functions using hypergraph-entropy. SIAM J. of Discrete Math. (1995)
16. Schobbens, P.-Y., Heymans, P., Trigaux, J.-C., Bontemps, Y.: Generic semantics of feature diagrams. Computer Networks (2007)
17. Shpilka, A., Volkovich, I.: Improved polynomial identity testing of read-once formulas. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. LNCS, vol. 5687, pp. 700-713. Springer, Heidelberg (2009)
18. Thüm, T., Batory, D. S., Kästner, C.: Reasoning about edits to feature models. In: ICSE (2009)
19. Trigaux, J.-C.: Quality of Feature Diagram Languages: Formal Evaluation and Comparison. PhD dissertation, University of Namur, Namur, Belgium (2008)
20. van den Broek, P., Galvão, I.: Analysis of feature models using generalised feature trees. In: Variability Modelling of Software-Intensive Systems (2009)
21. van den Broek, P., Galvão, I., Noppen, J.: Elimination of constraints from feature trees. In: SPLC 2008 (2008)
22. Zave, P.: Feature interactions and formal specifications in telecommunications. Computer (1993)
23. Zhang, W., Zhao, H., Mei, H.: A propositional logic-based method for verification of feature models. In: Davies, J., Schulte, W., Barnett, M. (eds.) ICFEM 2004. LNCS, vol. 3308, pp. 115-130. Springer, Heidelberg (2004)