An environment for benchmarking combinatorial test suite generators

被引:9
作者
Bombarda, Andrea [1 ]
Crippa, Edoardo [1 ]
Gargantini, Angelo [1 ]
机构
[1] Univ Bergamo, Dept Engn, Bergamo, Italy
来源
2021 IEEE INTERNATIONAL CONFERENCE ON SOFTWARE TESTING, VERIFICATION AND VALIDATION WORKSHOPS (ICSTW 2021) | 2021年
关键词
Test Suite Generation; Combinatorial Testing; Benchmarking;
D O I
10.1109/ICSTW52544.2021.00021
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
New tools for combinatorial test generation are proposed every year. However, different generators may have different performances on different models, in terms of the number of tests produced and generation time, so the choice of which generator has to be used can be challenging. Classical comparison between CIT generators considers only the number of tests composing the test suite. Still, especially when the time dedicated to testing activity is limited, generation time can be determinant. Thus, we propose a benchmarking framework including 1) a set of generic benchmark models, 2) an interface to easily integrate new generators, 3) methods to benchmark each generator against the others and to check validity and completeness. We have tested the proposed environment using five different generators (ACTS, CAgen, CASA, Medici, and PICT), comparing the obtained results in terms of the number of test cases and generation times, errors, completeness, and validity. Finally, we propose a CIT competition, between combinatorial generators, based on our framework.
引用
收藏
页码:48 / 56
页数:9
相关论文
共 20 条
  • [1] [Anonymous], 2005, PROC GECCO
  • [2] Validation of Models and Tests for Constrained Combinatorial Interaction Testing
    Arcaini, Paolo
    Gargantini, Angelo
    Vavassori, Paolo
    [J]. 2014 SEVENTH IEEE INTERNATIONAL CONFERENCE ON SOFTWARE TESTING, VERIFICATION AND VALIDATION WORKSHOPS (ICSTW 2014), 2014, : 98 - 107
  • [3] International Competition on Software Testing (Test-Comp)
    Beyer, Dirk
    [J]. TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PT III, 2019, 11429 : 167 - 175
  • [4] Biere Armin, 2008, Journal on Satisfiability, Boolean Modeling and Computation (JSAT), V4, P75, DOI 10.3233/sat190039
  • [5] An extensible SAT-solver
    Eén, N
    Sörensson, N
    [J]. THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2004, 2919 : 502 - 518
  • [6] Efficient combinatorial test generation based on multivalued decision diagrams
    [J]. Gargantini, Angelo (angelo.gargantini@unibg.it), 1600, Springer Verlag (8855): : 220 - 235
  • [7] Gargantini A, 2015, 2015 IEEE 8 INT C SO
  • [8] Migrating combinatorial interaction test modeling and generation to the web
    Gargantini, Angelo
    Radavelli, Marco
    [J]. 2018 IEEE 11TH INTERNATIONAL CONFERENCE ON SOFTWARE TESTING, VERIFICATION AND VALIDATION WORKSHOPS (ICSTW), 2018, : 308 - 317
  • [9] Evaluating improvements to a meta-heuristic search for constrained interaction testing
    Garvin, Brady J.
    Cohen, Myra B.
    Dwyer, Matthew B.
    [J]. EMPIRICAL SOFTWARE ENGINEERING, 2011, 16 (01) : 61 - 102
  • [10] An Improved Meta-Heuristic Search for Constrained Interaction Testing
    Garvin, Brady J.
    Cohen, Myra B.
    Dwyer, Matthew B.
    [J]. 1ST INTERNATIONAL SYMPOSIUM ON SEARCH BASED SOFTWARE ENGINEERING, PROCEEDINGS, 2009, : 13 - 22