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 条
  • [21] Selection hyper-heuristics for the multi and many-objective quadratic assignment problem
    Venske, Sandra M.
    Almeida, Carolina P.
    Lüders, Ricardo
    Delgado, Myriam R.
    Computers and Operations Research, 2022, 148
  • [22] On many-objective feature selection and the need for interpretability
    Njoku, Uchechukwu F.
    Abello, Alberto
    Bilalli, Besim
    Bontempi, Gianluca
    EXPERT SYSTEMS WITH APPLICATIONS, 2025, 267
  • [23] MANY-OBJECTIVE SENSOR SELECTION IN IOT SYSTEMS
    Lin, Chun-Cheng
    Deng, Der-Jiunn
    Lu, Liang-Yi
    IEEE WIRELESS COMMUNICATIONS, 2017, 24 (03) : 40 - 47
  • [24] Discrete Many-objective Optimization Problems: The case of the Pickup and Delivery Problem
    Lopez Jaimes, Antonio
    Garcia-Najera, Abel
    2016 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2016, : 1123 - 1130
  • [25] PROBLEM DISCOVERY WITH MANY-OBJECTIVE VISUAL ANALYTICS
    Woodruff, Matthew
    Simpson, Timothy W.
    PROCEEDINGS OF THE ASME INTERNATIONAL DESIGN ENGINEERING TECHNICAL CONFERENCES AND COMPUTERS AND INFORMATION IN ENGINEERING CONFERENCE, 2016, VOL 2B, 2016, : 373 - 385
  • [26] PROBLEM EXPLORATION WITH MANY-OBJECTIVE VISUAL ANALYTICS
    Woodruff, Matthew
    Simpson, Timothy W.
    PROCEEDINGS OF THE ASME INTERNATIONAL DESIGN ENGINEERING TECHNICAL CONFERENCES AND COMPUTERS AND INFORMATION IN ENGINEERING CONFERENCE, 2016, VOL 2B, 2016, : 361 - 371
  • [27] Proposal of a Realistic Many-Objective Test Suite
    Chen, Weiyu
    Ishibuchi, Hisao
    Shang, Ke
    PARALLEL PROBLEM SOLVING FROM NATURE - PPSN XVI, PT I, 2020, 12269 : 201 - 214
  • [28] Evolutionary Multi/Many-Objective Optimisation via Bilevel Decomposition
    Shouyong Jiang
    Jinglei Guo
    Yong Wang
    Shengxiang Yang
    IEEE/CAA Journal of Automatica Sinica, 2024, 11 (09) : 1973 - 1986
  • [29] Many-Objective Optimisation of Trusses Through Meta-Heuristics
    Pholdee, Nantiwat
    Bureerat, Sujin
    Jaroenapibal, Papot
    Radpukdee, Thana
    ADVANCES IN NEURAL NETWORKS, PT I, 2017, 10261 : 143 - 152
  • [30] Visualising Evolution History in Multi- and Many-objective Optimisation
    Walter, Mathew J.
    Walker, David J.
    Craven, Matthew J.
    PARALLEL PROBLEM SOLVING FROM NATURE - PPSN XVI, PT II, 2020, 12270 : 299 - 312