loading...
Configuration Strategies for Evolutionary Testing
Edinburgh, Scotland July 26-July 28
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/COMPSAC.2005.6029th Annual International Computer So ...
 This Article 
 
PURCHASE ARTICLE: $0
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Xiaoyuan Xie, Southeast University and Jiangsu Institute of Software Quality
Baowen Xu, Southeast University, Jiangsu Institute of Software Quality, National University of Defense Technology and Wuhan University
Changhai Nie, Southeast University and Jiangsu Institute of Software Quality
Liang Shi, Southeast University and Jiangsu Institute of Software Quality
Lei Xu, Southeast University and Jiangsu Institute of Software Quality
Evolutionary Testing (ET) is a kind of efficient method of automatically test case generation. ET uses a kind of meta-heuristic search technique, the Genetic Algorithm, to convert the task of test case generation into an optimal problem. Nowadays, ET has been widely researched in many areas, especially in the GA configuration problem. In this paper, we suggest two strategies for the Genetic Algorithm configuration, to improve the performance of ET. One is Annealing Genetic Algorithm (AGA), which alters the mutation probability dynamically, and the other is Restricted Genetic Algorithm (RGA), which adds restrictions into fitness functions. The two strategies made ET hit the global optimal solution in fewer generations, and most offspring genes located in the legal domain.
Citation:
Xiaoyuan Xie, Baowen Xu, Changhai Nie, Liang Shi, Lei Xu, "Configuration Strategies for Evolutionary Testing," compsac, vol. 2, pp.13-14, 29th Annual International Computer Software and Applications Conference (COMPSAC'05) Volume 2, 2005
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions