Multi-path Coverage Test Case Generation Combining Chained SVM and XGBoost

被引:0
|
作者
Qian, Zhong-Sheng [1 ]
Yu, Qing-Yuan [1 ]
Zhang, Ding [1 ]
Yao, Chang-Sen [1 ]
Qin, Lang-Yue [1 ]
Cheng, Yi-Wei [1 ]
机构
[1] School of Information Management, Jiangxi University of Finance and Economics, Nanchang,330013, China
来源
Ruan Jian Xue Bao/Journal of Software | 2024年 / 35卷 / 06期
关键词
D O I
10.13328/j.cnki.jos.006905
中图分类号
学科分类号
摘要
Machine learning methods can be well combined with software testing to enhance test effect, but few scholars have applied it to test data generation. In order to further improve the efficiency of test data generation, a chained model combining support vector machine (SVM) and extreme gradient boosting (XGBoost) is proposed, and multi-path test data generation is realized by a genetic algorithm based on the chained model. Firstly, this study uses certain samples to train several sub-models (i.e., SVM and XGBoost) for predicting the state of path nodes, filters the optimal sub-models based on the prediction accuracy value of the sub-models, and links the optimal sub-models in sequence according to the order of the path nodes, so as to form a chained model, namely chained SVM and XGBoost (C-SVMXGBoost). When using the genetic algorithm to generate test cases, the study makes use of the chained model that is trained instead of the instrumentation method to obtain the test data coverage path (i.e., predicted path), finds the path set with the predicted path similar to the target path, performs instrumentation verification on the predicted path with similar path sets, obtains accurate paths, and calculates fitness values. In the crossover and mutation process, excellent test cases with a large path level depth in the sample set are introduced for reuse to generate test data covering the target path. Finally, individuals with higher fitness during the evolutionary generation are saved, and C-SVMXGBoost is updated, so as to further improve the test efficiency. Experiments show that C-SVMXGBoost is more suitable for solving the path prediction problem and improving the test efficiency than other chained models. Moreover, compared with the existing classical methods, the proposed method can increase the coverage rate by up to 15%. The mean evolutionary algebra is also reduced, and the reduction percentage can reach 65% on programs of large size. © 2024 Chinese Academy of Sciences. All rights reserved.
引用
收藏
页码:2795 / 2820
相关论文
共 50 条
  • [41] Performance analysis for maximal ratio combining of correlated Rician multi-path fading signals with noise
    Wang, Zhuwei
    Chen, Xubin
    Zhang, Xin
    Yang, Dacheng
    [J]. 2008 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, PROCEEDINGS, VOLS 1-13, 2008, : 4634 - 4638
  • [42] Combining multi-path forwarding and packet aggregation for improved network performance in wireless mesh networks
    Di Stasi, Giovanni
    Karlsson, Jonas
    Avallone, Stefano
    Canonico, Roberto
    Kassler, Andreas
    Brunstrom, Anna
    [J]. COMPUTER NETWORKS, 2014, 64 : 26 - 37
  • [43] A Test Case Design Method Based on Path Depth Coverage
    Yan, Yunqiang
    Wu, Linbo
    Peng, Yanhong
    Nie, Changhai
    [J]. 2019 COMPANION OF THE 19TH IEEE INTERNATIONAL CONFERENCE ON SOFTWARE QUALITY, RELIABILITY AND SECURITY (QRS-C 2019), 2019, : 89 - 96
  • [44] Automated Test Case Generation based on Coverage Analysis
    Majchrzak, Tim A.
    Kuchen, Herbert
    [J]. THIRD INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF SOFTWARE ENGINEERING, PROCEEDINGS, 2009, : 259 - 266
  • [45] Test case generation of a protocol by a fault coverage analysis
    Kim, TH
    Hwang, IS
    Jang, MS
    Kang, SW
    Lee, JY
    Lee, SB
    [J]. TWELFTH INTERNATIONAL CONFERENCE ON INFORMATION NETWORKING (ICOIN-12), PROCEEDINGS, 1998, : 690 - 695
  • [46] The Risks of Coverage-Directed Test Case Generation
    Gay, Gregory
    Staats, Matt
    Whalen, Michael
    Heimdahl, Mats P. E.
    [J]. IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2015, 41 (08) : 803 - 819
  • [47] Synthesis of adjustable spherical four-link mechanisms for approximate multi-path generation
    Chanekar, Prasad Vilas
    Fenelon, Michael Angelo Amith
    Ghosal, Ashitava
    [J]. MECHANISM AND MACHINE THEORY, 2013, 70 : 538 - 552
  • [48] Automated Test Case Generation for Path Coverage by Using Multi-Objective Particle Swarm Optimization Algorithm with Reinforcement Learning and Relationship Matrix Strategies
    Liang, Shuwen
    He, Zhitao
    [J]. INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING, 2024, 34 (08) : 1221 - 1249
  • [49] Automated placental abruption identification using semantic segmentation, quantitative features, SVM, ensemble and multi-path CNN
    Asadpour, Vahid
    Puttock, Eric J.
    Getahun, Darios
    Fassett, Michael J.
    Xie, Fagen
    [J]. HELIYON, 2023, 9 (02)
  • [50] Path Reliability in Automated Test Case Generation Process
    Choudhary, Kavita
    Rani, Payal
    Shilpa
    [J]. INFORMATION SYSTEMS DESIGN AND INTELLIGENT APPLICATIONS, VOL 1, INDIA 2016, 2016, 433 : 467 - 474