Automated Test Case Generation as a Many-Objective Optimisation Problem with Dynamic Selection of the Targets

被引:207
|
作者
Panichella, Annibale [1 ]
Kifetew, Fitsum Meshesha [2 ]
Tonella, Paolo [2 ]
机构
[1] Univ Luxembourg, SnT, L-4365 Esch Sur Alzette, Luxembourg
[2] Fdn Bruno Kessler, Software Engn Unit, I-38122 Trento, Italy
关键词
Evolutionary testing; many-objective optimisation; automatic test case generation; EVOLUTIONARY ALGORITHMS;
D O I
10.1109/TSE.2017.2663435
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The test case generation is intrinsically a multi-objective problem, since the goal is covering multiple test targets (e.g., branches). Existing search-based approaches either consider one target at a time or aggregate all targets into a single fitness function (whole-suite approach). Multi and many-objective optimisation algorithms (MOAs) have never been applied to this problem, because existing algorithms do not scale to the number of coverage objectives that are typically found in real-world software. In addition, the final goal for MOAs is to find alternative trade-off solutions in the objective space, while in test generation the interesting solutions are only those test cases covering one or more uncovered targets. In this paper, we present Dynamic Many-Objective Sorting Algorithm (DynaMOSA), a novel many-objective solver specifically designed to address the test case generation problem in the context of coverage testing. DynaMOSA extends our previous many-objective technique Many-Objective Sorting Algorithm (MOSA) with dynamic selection of the coverage targets based on the control dependency hierarchy. Such extension makes the approach more effective and efficient in case of limited search budget. We carried out an empirical study on 346 Java classes using three coverage criteria (i.e., statement, branch, and strong mutation coverage) to assess the performance of DynaMOSA with respect to the whole-suite approach (WS), its archive-based variant (WSA) and MOSA. The results show that DynaMOSA outperforms WSA in 28 percent of the classes for branch coverage (+8 percent more coverage on average) and in 27 percent of the classes for mutation coverage (+11 percent more killed mutants on average). It outperforms WS in 51 percent of the classes for statement coverage, leading to +11 percent more coverage on average. Moreover, DynaMOSA outperforms its predecessor MOSA for all the three coverage criteria in 19 percent of the classes with +8 percent more code coverage on average.
引用
收藏
页码:122 / 158
页数:37
相关论文
共 50 条
  • [31] Analyses of inverted generational distance for many-objective optimisation algorithms
    Cai, Xingjuan
    Zhang, Maoqing
    Wang, Hui
    Xu, Meng
    Chen, Jinjun
    Zhang, Wensheng
    INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2019, 14 (01) : 62 - 68
  • [32] Evolutionary Multi/Many-Objective Optimisation via Bilevel Decomposition
    Jiang, Shouyong
    Guo, Jinglei
    Wang, Yong
    Yang, Shengxiang
    IEEE-CAA JOURNAL OF AUTOMATICA SINICA, 2024, 11 (09) : 1973 - 1986
  • [33] An Evolutionary Many-Objective Optimisation Algorithm with Adaptive Region Decomposition
    Liu, Hai-Lin
    Chen, Lei
    Zhang, Qingfu
    Deb, Kalyanmoy
    2016 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2016, : 4763 - 4769
  • [34] Using a many-objective approach to investigate automated refactoring
    Mohan, M.
    Greer, D.
    INFORMATION AND SOFTWARE TECHNOLOGY, 2019, 112 : 83 - 101
  • [35] A Visualisation Method for Pareto Front Approximations in Many-objective Optimisation
    Wu, Kai Eivind
    Panoutsos, George
    2021 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC 2021), 2021, : 1929 - 1937
  • [36] Solving many-objective optimisation problems using partial dominance
    Helbig, Marde
    Engelbrecht, Andries
    NEURAL COMPUTING & APPLICATIONS, 2023, 37 (2): : 653 - 694
  • [37] Many-objective design optimisation of a plain weave fabric composite
    Wang, Zhenzhou
    Sobey, Adam
    COMPOSITE STRUCTURES, 2022, 285
  • [38] Empirical Analysis of A Partial Dominance Approach to Many-Objective Optimisation
    Engelbrecht, Andries
    Helbig, Marde
    2020 4TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS, METAHEURISTICS & SWARM INTELLIGENCE (ISMSI 2020), 2020, : 71 - 75
  • [39] Ensemble mating selection in evolutionary many-objective search
    Zhang, Yu-Hui
    Gong, Yue-Jiao
    Gu, Tian-Long
    Zhang, Jun
    APPLIED SOFT COMPUTING, 2019, 76 : 294 - 312
  • [40] A Many-Objective Test Problem for Visually Examining Diversity Maintenance Behavior in a Decision Space
    Ishibuchi, Hisao
    Akedo, Naoya
    Nojima, Yusuke
    GECCO-2011: PROCEEDINGS OF THE 13TH ANNUAL GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2011, : 649 - 656