Article

Measuring the structural complexity of feature models

Authors:

Vanessa Stricker,

Klaus PohlAuthors Info & Claims

ASE '13: Proceedings of the 28th IEEE/ACM International Conference on Automated Software Engineering

Pages 454 - 464

https://doi.org/10.1109/ASE.2013.6693103

Published: 11 November 2013 Publication History

Publisher Site Get Access

Abstract

The automated analysis of feature models (FM) is based on SAT, BDD, and CSP - known NP-complete problems. Therefore, the analysis could have an exponential worst-case execution time. However, for many practical relevant analysis cases, state-of-the-art (SOTA) analysis tools quite successfully master the problem of exponential worst-case execution time based on heuristics. So far, however, very little is known about the structure of FMs that cause the cases in which the execution time (hardness) for analyzing a given FM increases unpredictably for SOTA analysis tools. In this paper, we propose to use width measures from graph theory to characterize the structural complexity of FMs as a basis for an estimation of the hardness of analysis operations on FMs with SOTA analysis tools. We present an experiment that we use to analyze the reasonability of graph width measures as metric for the structural complexity of FMs and the hardness of FM analysis. Such a complexity metric can be used as a basis for a unified method to systematically improve SOTA analysis tools.

References

[1]

E. Bagheri and D. Gasevic. Assessing the maintainability of software product line feature models using structural metrics. Software Quality Journal, 19, 9 2011.

Digital Library

[2]

Y. Ben-Haim, A. Ivrii, O. Margalit, and A. Matsliah. Perfect hashing and CNF encodings of cardinality constraints. In Proc. 15th Int. Conf. on Theory and Application of Satisfiability Testing, pages 397-409. Springer, 2012.

Digital Library

[3]

D. Benavides, S. Segura, and A. Ruiz-Cortés. Automated analysis of feature models 20 years later: A literature review. Inf. Syst., 35(6):615-636, 2010.

Digital Library

[4]

D. Benavides, S. Segura, P. Trinidad, and A. Ruiz-Cortés. A first step towards a framework for the automated analysis of feature models. In Managing Variability for Software Product Lines: Working With Variability Mechanisms, 2006.

[5]

D. Benavides, P. Trinidad, and A. Ruiz-Cortés. Automated reasoning on feature models. In Proc. 17th Int. Conf. on Advanced Information Systems Engineering, pages 381-390. Springer, 2005.

Digital Library

[6]

A. Biere, M. Heule, H. van Maaren, and T. Walsh. Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications. IOS Press, Amsterdam, The Netherlands, The Netherlands, 2009.

Digital Library

[7]

H. L. Bodlaender. Treewidth: Characterizations, applications, and computations. In Proc. 32nd Int. WS on Graph-Theoretic Concepts in Computer Science, pages 1-14. Springer, 2006.

Digital Library

[8]

B. Courcelle and S. Olariu. Upper bounds to the clique width of graphs. Discrete Appl. Math., 101(1-3):77-114, 2000.

Digital Library

[9]

K. Czarnecki, P. Grünbacher, R. Rabiser, K. Schmid, and A. Wasowski. Cool features and tough decisions: a comparison of variability modeling approaches. In Proc. 6th Int. WS on Variability Modeling of Software-Intensive Systems, pages 173-182, New York, NY, USA, 2012. ACM.

Digital Library

[10]

A. Favier, S. De Givry, and P. Jégou. Exploiting problem structure for solution counting. In Proc. 15th Int. Conf. on Principles and Practice of Constraint Programming, pages 335-343, Berlin/Heidelberg, 2009. Springer.

Digital Library

[11]

R. Ganian, P. Hlineny, and J. Obdržálek. Better algorithms for satisfiability problems for formulas of bounded rank-width. ArXiv eprints, 2010.

[12]

R. Ganian, P. Hlineny, J. Kneis, D. Meister, J. Obdržálek, P. Rossmanith, and S. Sikdar. Are there any good digraph width measures? In Proc. 5th Int. WS on Parameterized and Exact Computation, pages 135-146. Springer, 2010.

[13]

Y. Gil, S. Kremer-Davidson, and I. Maman. Sans constraints? feature diagrams vs. feature models. In Proc. 14th Int. Conf. on Software Product Lines, pages 271-285, Berlin/Heidelberg, 2010. Springer.

Digital Library

[14]

M. Grohe. The structure of tractable constraint satisfaction problems. In Proc. 31st Int. Conf. on Mathematical Foundations of Computer Science, pages 58-72, Berlin/Heidelberg, 2006. Springer.

Digital Library

[15]

P. Hlineny, S.-I. Oum, D. Seese, and G. Gottlob. Width parameters beyond tree-width and their applications. Computer Journal, 51(3):326-362, 2008.

Digital Library

[16]

G. Janssen. A consumer report on BDD packages. In Proc. 16th Symp. on Integrated Circuits and Systems Design, pages 217-222, 2003.

Digital Library

[17]

K. Kang, S. Cohen, J. Hess, W. Novak, and A. S. Peterson. Feature-Oriented Domain Analysis (FODA) Feasibility Study. Tech. rep., CMU Software Engineering Institute, 1990.

[18]

H. Katebi, K. A. Sakallah, and J. a. P. Marques-Silva. Empirical study of the anatomy of modern SAT solvers. In Proc. 14th Int. Conf. on Theory and Application of Satisfiability Testing, pages 343-356, Berlin, Heidelberg, 2011. Springer-Verlag.

Digital Library

[19]

C. Luque, M. Moreto, F. Cazorla, R. Gioiosa, A. Buyuktosunoglu, and M. Valero. CPU accounting for multicore processors. IEEE Transactions on Computers, 61(2):251-264, 2012.

Digital Library

[20]

D. Marx. Approximating fractional hypertree width. In Proc. Annual ACM-SIAM Symposium on Discrete Algorithms, pages 902-911, 2009.

Digital Library

[21]

M. Mendonca, A. Wasowski, and K. Czarnecki. SAT-based analysis of feature models is easy. In Proceedings of the 13th Int. Software Product Line Conf., SPLC '09, pages 231-240, Pittsburgh, PA, USA, 2009. Carnegie Mellon University.

Digital Library

[22]

M. Mendonça. Efficient Reasoning Techniques for Large Scale Feature Models. PhD thesis, University of Waterloo, 2008.

[23]

S.-i. Oum. Rank-width and vertex-minors. J. Comb. Theory Ser. B, 95(1):79-100, 2005.

Digital Library

[24]

J. Petke and P. Jeavons. The order encoding: From tractable CSP to tractable SAT. In Proc. 14th Int. Conf. on Theory and Application of Satisfiability Testing, pages 371-372. Springer, 2011.

Digital Library

[25]

K. Pohl, G. Böckle, and F. J. v. d. Linden. Software Product Line Engineering: Foundations, Principles and Techniques. Springer New York, Inc., Secaucus, NJ, USA, 2005.

Digital Library

[26]

R. Pohl, K. Lauenroth, and K. Pohl. A performance comparison of contemporary algorithmic approaches for automated analysis operations on feature models. In Proc. 26th IEEE/ACM Int. Conf. on Automated Software Engineering, pages 313-322, Washington, DC, USA, 2011. IEEE Computer Society.

Digital Library

[27]

N. Robertson and P. Seymour. Graph minors. III. planar tree-width. J. Combinatorial Theory, Series B, 36(1):49-64, 1984.

[28]

M. Samer and S. Szeider. Constraint satisfaction with bounded treewidth revisited. J. Computer and System Sciences, 76(2):103-114, 2010.

Digital Library

[29]

A. S. Sayyad, T. Menzies, and H. Ammar. On the value of user preferences in search-based software engineering: a case study in software product lines. In Proceedings of the 2013 International Conference on Software Engineering, ICSE '13, pages 492-501, Piscataway, NJ, USA, 2013. IEEE Press.

Digital Library

[30]

P.-Y. Schobbens, P. Heymans, and J.-C. Trigaux. Feature diagrams: A survey and a formal semantics. In Proc. 14th IEEE Int. Conf. on Requirements Engineering, pages 139-148, 2006.

Digital Library

[31]

S. Segura, J. Galindo, D. Benavides, J. Parejo, and A. Ruiz-Cortés. BeTTy: Benchmarking and testing on the automated analysis of feature models. In U. Eisenecker, S. Apel, and S. Gnesi, editors, Sixth International WS on Variability Modelling of Software-intensive Systems (VaMoS'12), page 63-71, Leipzig, Germany, 2012. ACM, ACM.

Digital Library

[32]

S. Segura, J. Parejo, R. Hierons, and A. Ruiz-Cortés. ETHOM: An evolutionary algorithm for optimized feature models generation (v. 1.1). Technical report, 2012.

[33]

S. She, R. Lotufo, T. Berger, A. Wasowski, and K. Czarnecki. Variability model of the Linux kernel. In Fourth International Workshop on Variability Modeling of Software-intensive Systems (VaMoS 2010), Linz, Austria, 2010.

[34]

C. Sinz. Towards an optimal CNF encoding of boolean cardinality constraints. In Proc. 11th Int. Conf. on Principles and Practice of Constraint Programming, pages 827-831. Springer, 2005.

Digital Library

[35]

N. Tamura, A. Taga, S. Kitagawa, and M. Banbara. Compiling finite linear CSP into SAT. Constraints, 14:254-272, 2009.

Digital Library

[36]

V. Štuikys and R. Damaševičius. Measuring complexity of domain models represented by feature diagrams. Information Technology and Control, 38(3):179-187, 2009.

[37]

C. Wohlin, P. Runeson, M. Höst, M. C. Ohlsson, B. Regnell, and A. Wesslén. Experimentation in software engineering: an introduction. Kluwer Academic Publishers, Norwell, MA, USA, 2000.

Digital Library

Cited By

Duszynski SDhar SBeichter T(2019)Using Relation Graphs for Improved Understanding of Feature Models in Software Product LinesProceedings of the 23rd International Systems and Software Product Line Conference - Volume A10.1145/3336294.3336317(309-319)Online publication date: 9-Sep-2019
https://dl.acm.org/doi/10.1145/3336294.3336317
Galindo JAcher MTirado JVidal CBaudry BBenavides DMei H(2016)Exploiting the enumeration of all feature model configurationsProceedings of the 20th International Systems and Software Product Line Conference10.1145/2934466.2934478(74-78)Online publication date: 16-Sep-2016
https://dl.acm.org/doi/10.1145/2934466.2934478
Metzger ABayer ADoyle DSharifloo APohl KWessling F(2016)Coordinated run-time adaptation of variability-intensive systemsProceedings of the 1st International Workshop on Variability and Complexity in Software Design10.1145/2897045.2897049(5-11)Online publication date: 14-May-2016
https://dl.acm.org/doi/10.1145/2897045.2897049
Show More Cited By

Recommendations

Structural Average Case Complexity

Levin introduced an average-case complexity measure, based on a notion of “polynomial on average,” and defined “average-case polynomial-time many-one reducibility” among randomized decision problems. We generalize his notions of average-case complexity ...
Structural issues in parameterized complexity
The structural complexity of intractable search functions

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ASE '13: Proceedings of the 28th IEEE/ACM International Conference on Automated Software Engineering

November 2013

765 pages

ISBN:9781479902156

General Chair:
Ewen Denney
SGT, NASA, Ames Research Center, Moffett Field
,
Program Chairs:
Tevfik Bultan
University of California, Santa Barbara
,
Andreas Zeller
Saarland University, Saarbrücken, Germany

Sponsors

NASA: National Aeronatics and Space Administration
SIGAI: ACM Special Interest Group on Artificial Intelligence
IEEE: IEEE Computer Society Technical Committee on Design Automation
SIGSOFT: ACM Special Interest Group on Software Engineering
Microsoft: Microsoft

Publisher

IEEE Press

Publication History

Published: 11 November 2013

Check for updates

Author Tags

Qualifiers

Article

Conference

ASE '13

Sponsor:

NASA
SIGAI
IEEE
SIGSOFT
Microsoft

ASE '13: Automated Software Engineering

November 11 - 15, 2013

CA, Silicon Valley, USA

Acceptance Rates

Overall Acceptance Rate 82 of 337 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
45
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Duszynski SDhar SBeichter T(2019)Using Relation Graphs for Improved Understanding of Feature Models in Software Product LinesProceedings of the 23rd International Systems and Software Product Line Conference - Volume A10.1145/3336294.3336317(309-319)Online publication date: 9-Sep-2019
https://dl.acm.org/doi/10.1145/3336294.3336317
Galindo JAcher MTirado JVidal CBaudry BBenavides DMei H(2016)Exploiting the enumeration of all feature model configurationsProceedings of the 20th International Systems and Software Product Line Conference10.1145/2934466.2934478(74-78)Online publication date: 16-Sep-2016
https://dl.acm.org/doi/10.1145/2934466.2934478
Metzger ABayer ADoyle DSharifloo APohl KWessling F(2016)Coordinated run-time adaptation of variability-intensive systemsProceedings of the 1st International Workshop on Variability and Complexity in Software Design10.1145/2897045.2897049(5-11)Online publication date: 14-May-2016
https://dl.acm.org/doi/10.1145/2897045.2897049
von Rhein AGrebhahn AApel SSiegmund NBeyer DBerger TBertolino ACanfora GElbaum S(2015)Presence-condition simplification in highly configurable systemsProceedings of the 37th International Conference on Software Engineering - Volume 110.5555/2818754.2818779(178-188)Online publication date: 16-May-2015
https://dl.acm.org/doi/10.5555/2818754.2818779
Liang JGanesh VCzarnecki KRaman VSchmidt D(2015)SAT-based analysis of large real-world feature models is easyProceedings of the 19th International Conference on Software Product Line10.1145/2791060.2791070(91-100)Online publication date: 20-Jul-2015
https://dl.acm.org/doi/10.1145/2791060.2791070
Tan TXue YChen MSun JLiu YDong JYoung MXie T(2015)Optimizing selection of competing features via feedback-directed evolutionary algorithmsProceedings of the 2015 International Symposium on Software Testing and Analysis10.1145/2771783.2771808(246-256)Online publication date: 13-Jul-2015
https://dl.acm.org/doi/10.1145/2771783.2771808

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents