Sans Constraints? Feature Diagrams vs. Feature Models

  • Yossi Gil
  • Shiri Kremer-Davidson
  • Itay Maman
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6287)


In this paper we study constraints—inter-dependencies between basic features in a feature model which are not captured by diagrams. We offer a method for the removal of these constraints and explain why their removal require an (inevitable) exponential increase to the tree size. We show that the elimination of constraints makes it possible to provide an efficient solution for the feature editing problem, recently raised by Thüm, Batory and Kästner. We tie feature models with computer science fields which may appear very foreign to our domain, including circuit complexity, graph algorithms and algebraic complexity. The objective of this tie is double folded: drawing the attention of the foreign community to the problems we address in our field, and to suggest the use of current results in these fields for better understanding of the mathematics behind the modeling of software product lines.


Boolean Function Feature Model Expressive Power Software Product Line Linear Time Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alon, N., Boppana, R.B.: The monotone circuit complexity of boolean functions. Combinatorica (1987)Google Scholar
  2. 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)CrossRefGoogle Scholar
  3. 3.
    Czarnecki, K., Helsen, S., Eisenecker, U.W.: Formalizing cardinality-based feature models and their specialization. Software Process: Improvement and Practice (2005)Google Scholar
  4. 4.
    Czarnecki, K., Wasowski, A.: Feature diagrams and logics: There and back again. In: SPLC 2007 (2007)Google Scholar
  5. 5.
    Gilbert, E.N.: Lattice theoretic properties of frontal switching functions. J. Math. Phys. (1954)Google Scholar
  6. 6.
    Golumbic, M.C., Mintz, A., Rotics, U.: An improvement on the complexity of factoring read-once boolean functions. Discrete Applied Mathematics (2008)Google Scholar
  7. 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)Google Scholar
  8. 8.
    Kaltofen, E.: Factorization of polynomials given by straight-line programs. In: Randomness and Computation, pp. 375–412. JAI Press, Greenwich (1989)Google Scholar
  9. 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)Google Scholar
  10. 10.
    Karchmer, M., Linial, N., Newman, I., Saks, M., Wigderson, A.: Combinatorial characterization of read once formulae. J. Discrete Math. (1993)Google Scholar
  11. 11.
    Karchmer, M., Wigderson, A.: Monotone circuits for connectivity require super-logarithmic depth. SIAM J. Discrete Math. (1990)Google Scholar
  12. 12.
    McGeer, P.C., Brayton, R.K.: Efficient prime factorization of logic expressions. In: DAC 1989 (1989)Google Scholar
  13. 13.
    Meinel, C., Theobald, T.: Algorithms and Data Structures in VLSI Design. Springer, New York (1998)MATHGoogle Scholar
  14. 14.
    Mendonca, M., Wasowski, A., Czarnecki, K.: Sat-based analysis of feature models is easy. In: SPLC 2009 (2009)Google Scholar
  15. 15.
    Newman, I., Wigderson, A.: Lower bounds on formula size of boolean functions using hypergraph-entropy. SIAM J. of Discrete Math. (1995)Google Scholar
  16. 16.
    Schobbens, P.-Y., Heymans, P., Trigaux, J.-C., Bontemps, Y.: Generic semantics of feature diagrams. Computer Networks (2007)Google Scholar
  17. 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)CrossRefGoogle Scholar
  18. 18.
    Thüm, T., Batory, D.S., Kästner, C.: Reasoning about edits to feature models. In: ICSE (2009)Google Scholar
  19. 19.
    Trigaux, J.-C.: Quality of Feature Diagram Languages: Formal Evaluation and Comparison. PhD dissertation, University of Namur, Namur, Belgium (2008)Google Scholar
  20. 20.
    van den Broek, P., Galvão, I.: Analysis of feature models using generalised feature trees. In: Variability Modelling of Software-Intensive Systems (2009)Google Scholar
  21. 21.
    van den Broek, P., Galvão, I., Noppen, J.: Elimination of constraints from feature trees. In: SPLC 2008 (2008)Google Scholar
  22. 22.
    Zave, P.: Feature interactions and formal specifications in telecommunications. Computer (1993)Google Scholar
  23. 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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Yossi Gil
    • 1
  • Shiri Kremer-Davidson
    • 1
  • Itay Maman
    • 1
  1. 1.IBM ResearchHaifa

Personalised recommendations