Performance Analysis of Several Intelligent Algorithms for Class Integration Test Order Optimization
-
Published:2023-09-04
Issue:17
Volume:12
Page:3733
-
ISSN:2079-9292
-
Container-title:Electronics
-
language:en
-
Short-container-title:Electronics
Author:
Zhang Wenning12, Zhou Qinglei3, Guo Li2, Zhao Dong2, Gou Ximei2
Affiliation:
1. State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou 450000, China 2. Software College, Zhongyuan University of Technology, Zhengzhou 450000, China 3. School of Information Engineering, Zhengzhou University, Zhengzhou 450000, China
Abstract
Integration testing is an essential activity in software testing, especially in object-oriented software development. Determining the sequence of classes to be integrated, i.e., the class integration test order (CITO) problem, is of great importance but computationally challenging. Previous research has shown that meta heuristic algorithms can devise class integration test orders with lower test stubbing complexity, resulting in software testing cost reduction. This study focuses on the comparable performance evaluation of ten commonly used meta heuristic algorithms: genetic algorithm (GA), particle swarm optimization (PSO), cuckoo search algorithm (CS), firefly algorithm (FA), bat algorithm (BA), grey wolf algorithm (GWO), moth flame optimization (MFO), sine cosine algorithm (SCA), salp swarm algorithm (SSA) and Harris hawk optimization (HHO). The objective of this study is to identify the most suited algorithms, narrowing down potential avenues for future researches in the field of search-based class integration test order generation. The standard implementations of these algorithms are employed to generate integration test orders. Additionally, these test orders are evaluated and compared in terms of stubbing complexity, convergence speed, average runtime, and memory consumption. The experimental results suggest that MFO, SSA, GWO and CS are the most suited algorithms. MFO, SSA and GWO exhibit excellent optimization performance in systems where fitness values are heavily impacted by attribute coupling. Meanwhile, MFO, GWO and CS are recommended for systems where the fitness values are strongly influenced by method coupling. BA and FA emerge as the slowest algorithms, while the remaining algorithms exhibit intermediate performance. The performance analysis may be used to select and improve appropriate algorithms for the CITO problem, providing a cornerstone for future scientific research and practical applications.
Funder
Science and Technology Planning Program of Henan Province
Subject
Electrical and Electronic Engineering,Computer Networks and Communications,Hardware and Architecture,Signal Processing,Control and Systems Engineering
Reference36 articles.
1. Performance Analysis of Six Meta-heuristic Algorithms over Automated Test Suite Generation for Path Coverage based Optimization;Khari;Soft Comput.,2021 2. Le Hanh, V., Akif, K., Le Traon, Y., and Jézéque, J.M. (2001, January 18–22). Selecting an Efficient OO Integration Testing Strategy: An Experimental comparison of Actual Strategies. Proceedings of the 15th European Conference on Object-Oriented Programming, Budapest, Hungary. 3. An Integration Test Order Strategy to Consider Control Coupling;Jiang;IEEE Trans. Softw. Eng.,2021 4. Kung, D., Gao, J., Hsia, P., Toyoshima, Y., and Chen, C. (1995, January 9–11). A Test Strategy for Object Oriented Programs. Proceedings of the 19th Annual International Computer Software and Applications Conference, Dallas, TX, USA. 5. Validating Class Integration Test Order Generation Systems with Metamorphic Testing;Zhang;Inf. Softw. Technol.,2021
|
|