Test Case-Aware Combinatorial Interaction Testing

被引:19
|
作者
Yilmaz, Cemal [1 ]
机构
[1] Sabanci Univ, Fac Engn & Nat Sci, TR-34956 Istanbul, Turkey
关键词
Software quality assurance; combinatorial interaction testing; covering arrays; TEST-GENERATION; ALGORITHM; COVERAGE;
D O I
10.1109/TSE.2012.65
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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 by using a battery of test cases. Traditional covering arrays, while taking system-wide interoption constraints into account, do not provide a systematic way of handling test case-specific interoption constraints. The basic justification for t-way covering arrays is that they can cost effectively exercise all system behaviors caused by the settings of t or fewer options. In this paper, we hypothesize, however, that in the presence of test case-specific interoption constraints, many such behaviors may not be tested due to masking effects caused by the overlooked test case-specific constraints. For example, if a test case refuses to run in a configuration due to an unsatisfied test case-specific constraint, none of the valid option setting combinations appearing in the configuration will be tested by that test case. To account for test case-specific constraints, we introduce a new combinatorial object, called a test case-aware covering array. A t-way test case-aware covering array is not just a set of configurations, as is the case in traditional covering arrays, but a set of configurations, each of which is associated with a set of test cases such that all test case-specific constraints are satisfied and that, for each test case, each valid combination of option settings for every combination of t options appears at least once in the set of configurations that the test case is associated with. We furthermore present three algorithms to compute test case-aware covering arrays. Two of the algorithms aim to minimize the number of configurations required (one is fast, but produces larger arrays, the other is slower, but produces smaller arrays), whereas the remaining algorithm aims to minimize the number of test runs required. The results of our empirical studies conducted on two widely used highly configurable software systems suggest that test case-specific constraints do exist in practice, that traditional covering arrays suffer from masking effects caused by ignorance of such constraints, and that test case-aware covering arrays are better than other approaches in handling test case-specific constraints, thus avoiding masking effects.
引用
收藏
页码:684 / 706
页数:23
相关论文
共 50 条
  • [1] Code-aware combinatorial interaction testing
    Ahmed, Bestoun S.
    Gargantini, Angelo
    Zamli, Kamal Z.
    Yilmaz, Cemal
    Bures, Miroslav
    Szeles, Marek
    [J]. IET SOFTWARE, 2019, 13 (06) : 600 - 609
  • [2] Combinatorial interaction regression testing: A study of test case generation and prioritization
    Qu, Xiao
    Cohen, Myra B.
    Woolf, Katherine M.
    [J]. 2007 IEEE INTERNATIONAL CONFERENCE ON SOFTWARE MAINTENANCE, 2007, : 405 - 414
  • [3] On The Effectiveness of Combinatorial Interaction Testing: A Case Study
    Bures, Miroslav
    Ahmed, Bestoun S.
    [J]. 2017 IEEE INTERNATIONAL CONFERENCE ON SOFTWARE QUALITY, RELIABILITY AND SECURITY COMPANION (QRS-C), 2017, : 69 - 76
  • [4] Comparison of Approaches to Prioritized Test Generation for Combinatorial Interaction Testing
    Kruse, Peter M.
    Schieferdecker, Ina
    [J]. 2012 FEDERATED CONFERENCE ON COMPUTER SCIENCE AND INFORMATION SYSTEMS (FEDCSIS), 2012, : 1323 - 1330
  • [5] Test case minimization approach using fault detection and combinatorial optimization techniques for configuration-aware structural testing
    Ahmed, Bestoun S.
    [J]. ENGINEERING SCIENCE AND TECHNOLOGY-AN INTERNATIONAL JOURNAL-JESTECH, 2016, 19 (02): : 737 - 753
  • [6] Beyond Combinatorial Interaction Testing: On the need for transition testing in dynamically adaptive context-aware systems
    Martou, Pierre
    Duhoux, Benoit
    Mens, Kim
    Legay, Axel
    [J]. 2023 IEEE INTERNATIONAL CONFERENCE ON SOFTWARE TESTING, VERIFICATION AND VALIDATION WORKSHOPS, ICSTW, 2023, : 100 - 104
  • [7] A Systematic Literature Review on Test Case Prioritization in Combinatorial Testing
    Manan, Muhammad Syafiq Abdul
    Jawawi, Dayang Norhayati Abang
    Ahmad, Johanna
    [J]. 5TH INTERNATIONAL CONFERENCE ON ALGORITHMS, COMPUTING AND SYSTEMS, ICACS 2021, 2021, : 55 - 61
  • [8] Test Effectiveness Evaluation of Prioritized Combinatorial Testing: A Case Study
    Choi, Eun-Hye
    Kawabata, Shunya
    Mizuno, Osamu
    Artho, Cyrille
    Kitamura, Takashi
    [J]. 2016 IEEE INTERNATIONAL CONFERENCE ON SOFTWARE QUALITY, RELIABILITY AND SECURITY (QRS 2016), 2016, : 61 - 68
  • [9] Adaptive Random Test Case Generation for Combinatorial Testing.
    Huang, Rubing
    Xie, Xiaodong
    Chen, Tsong Yueh
    Lu, Yansheng
    [J]. 2012 IEEE 36TH ANNUAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE (COMPSAC), 2012, : 52 - 61
  • [10] Test Algebra for Combinatorial Testing
    Tsai, Wei-Tek
    Colbourn, Charles J.
    Luo, Jie
    Qi, Guanqiu
    Li, Qingyang
    Bai, Xiaoying
    [J]. 2013 8TH INTERNATIONAL WORKSHOP ON AUTOMATION OF SOFTWARE TEST (AST), 2013, : 19 - 25