[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
research-article

Reducing Masking Effects in CombinatorialInteraction Testing: A Feedback DrivenAdaptive Approach

Published: 01 January 2014 Publication History

Abstract

The configuration spaces of modern software systems are too large to test exhaustively. Combinatorial interaction testing (CIT) approaches, such as covering arrays, systematically sample the configuration space and test only the selected configurations. The basic justification for CIT approaches is that they can cost-effectively exercise all system behaviors caused by the settings of $t$ or fewer options. We conjecture, however, that in practice some of these behaviors are not actually tested because of unanticipated masking effects – test case failures that perturb system execution so as to prevent some behaviors from being exercised. While prior research has identified this problem, most solutions require knowing the masking effects a priori. In practice this is impractical, if not impossible. In this work, we reduce the harmful consequences of masking effects. First we define a novel interaction testing criterion, which aims to ensure that each test case has a fair chance to test all valid t-way combinations of option settings. We then introduce a feedback driven adaptive combinatorial testing process (FDA-CIT) to materialize this criterion in practice. At each iteration of FDA-CIT, we detect potential masking effects, heuristically isolate their likely causes (i.e., fault characterization), and then generate new samples that allow previously masked combinations to be tested in configurations that avoid the likely failure causes. The iterations end when the new interaction testing criterion has been satisfied. This paper compares two different fault characterization approaches – an integral part of the proposed approach, and empirically assesses their effectiveness and efficiency in removing masking effects on two widely used open source software systems. It also compares FDA-CIT against error locating arrays, a state of the art approach for detecting and locating failures. Furthermore, the scalability of the proposed approach is evaluated by comparing it with perfect test scenarios, in which all masking effects are known a priori. Our results suggest that masking effects do exist in practice, and that our approach provides a promising and efficient way to work around them, without requiring that masking effects be known a priori.

Cited By

View all
  • (2024)Two improving approaches for faulty interaction localization using logistic regression analysisSoftware Quality Journal10.1007/s11219-024-09677-132:3(1039-1073)Online publication date: 1-Sep-2024
  • (2022)A Theory of Pending Schemas in Combinatorial TestingIEEE Transactions on Software Engineering10.1109/TSE.2021.311392048:10(4119-4151)Online publication date: 1-Oct-2022
  • (2020)An Interleaving Approach to Combinatorial Testing and Failure-Inducing Interaction IdentificationIEEE Transactions on Software Engineering10.1109/TSE.2018.286577246:6(584-615)Online publication date: 1-Jun-2020
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering  Volume 40, Issue 1
January 2014
99 pages

Publisher

IEEE Press

Publication History

Published: 01 January 2014

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 12 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Two improving approaches for faulty interaction localization using logistic regression analysisSoftware Quality Journal10.1007/s11219-024-09677-132:3(1039-1073)Online publication date: 1-Sep-2024
  • (2022)A Theory of Pending Schemas in Combinatorial TestingIEEE Transactions on Software Engineering10.1109/TSE.2021.311392048:10(4119-4151)Online publication date: 1-Oct-2022
  • (2020)An Interleaving Approach to Combinatorial Testing and Failure-Inducing Interaction IdentificationIEEE Transactions on Software Engineering10.1109/TSE.2018.286577246:6(584-615)Online publication date: 1-Jun-2020
  • (2020)An Empirical Comparison of Combinatorial Testing, Random Testing and Adaptive Random TestingIEEE Transactions on Software Engineering10.1109/TSE.2018.285274446:3(302-320)Online publication date: 1-Mar-2020
  • (2020)Using a Genetic Algorithm to Optimize Configurations in a Data-Driven ApplicationSearch-Based Software Engineering10.1007/978-3-030-59762-7_10(137-152)Online publication date: 7-Oct-2020
  • (2019)An empirical study of real-world variability bugs detected by variability-oblivious toolsProceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering10.1145/3338906.3338967(50-61)Online publication date: 12-Aug-2019
  • (2017)Prioritizing random combinatorial test suitesProceedings of the Symposium on Applied Computing10.1145/3019612.3019774(1183-1189)Online publication date: 3-Apr-2017
  • (2016)Using simulated annealing for computing cost-aware covering arraysApplied Soft Computing10.1016/j.asoc.2016.08.02249:C(1129-1144)Online publication date: 1-Dec-2016

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media