Automatic generation of basis test paths using variable length genetic algorithm

被引:47
作者
Ghiduk, Ahmed S. [1 ,2 ]
机构
[1] Taif Univ, Coll Comp & Informat Technol, At Taif, Saudi Arabia
[2] Beni Suef Univ, Fac Sci, Dept Math & Comp Sci, Bani Suwayf, Egypt
关键词
Software engineering; Genetic algorithm; Basis path testing; Test path generation; SOFTWARE TEST DATA;
D O I
10.1016/j.ipl.2014.01.009
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Path testing is the strongest coverage criterion in white box testing. Finding target paths is a key challenge in path testing. Genetic algorithms have been successfully used in many software testing activities such as generating test data, selecting test cases and test cases prioritization. In this paper, we introduce a new genetic algorithm for generating test paths. In this algorithm the length of the chromosome varies from iteration to another according to the change in the length of the path. Based on the proposed algorithm, we present a new technique for automatically generating a set of basis test paths which can be used as testing paths in any path testing method. The proposed technique uses a method to verify the independency of the generated paths to be included in the basis set of paths. In addition, this technique employs a method for checking the feasibility of the generated paths. We introduce new definitions for the key concepts of genetic algorithm such as chromosome representation, crossover, mutation, and fitness function to be compatible with path generation. In addition, we present a case study to show the efficiency of our technique. We conducted a set of experiments to evaluate the effectiveness of the proposed path generation technique. The results showed that the proposed technique causes substantial reduction in path generation effort, and that the proposed GA algorithm is effective in test path generation. (c) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:304 / 316
页数:13
相关论文
共 51 条
[41]  
Pargas R. P., 1999, Software Testing, Verification and Reliability, V9, P263, DOI 10.1002/(SICI)1099-1689(199912)9:4<263::AID-STVR190>3.0.CO
[42]  
2-Y
[43]  
Poole J., 1995, TECHNICAL REPORT
[44]   CONSTRUCTING THE CALL GRAPH OF A PROGRAM [J].
RYDER, BG .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1979, 5 (03) :216-226
[45]  
Srivastava P.R., 2009, P IEEE REG 10 ANN IN, DOI [10.1109/TENCON.2009.5396088, DOI 10.1109/TENCON.2009.5396088]
[46]   Compiling finite linear CSP into SAT [J].
Tamura, Naoyuki ;
Taga, Akiko ;
Kitagawa, Satoshi ;
Banbara, Mutsunori .
CONSTRAINTS, 2009, 14 (02) :254-272
[47]   Evolutionary test environment for automatic structural testing [J].
Wegener, J ;
Baresel, A ;
Sthamer, H .
INFORMATION AND SOFTWARE TECHNOLOGY, 2001, 43 (14) :841-854
[48]   An efficient method to generate feasible paths for basis path testing [J].
Yan, Jun ;
Zhang, Jian .
INFORMATION PROCESSING LETTERS, 2008, 107 (3-4) :87-92
[49]  
Yano Thaise, 2010, Proceedings of the IEEE Third International Conference on Software Testing Verification and Validation - Workshops (ICSTW 2010), P236, DOI 10.1109/ICSTW.2010.52
[50]   The automatic generation of basis set of path for path testing [J].
Zhang, GM ;
Rui, C ;
Li, XW ;
Han, CY .
14TH ASIAN TEST SYMPOSIUM, PROCEEDINGS, 2005, :46-49