학술논문

Natural optimization algorithms for optimal regression testing
Document Type
Conference
Source
Proceedings Twenty-First Annual International Computer Software and Applications Conference (COMPSAC'97) Computer software and applications Computer Software and Applications Conference, 1997. COMPSAC '97. Proceedings., The Twenty-First Annual International. :511-514 1997
Subject
Computing and Processing
Communication, Networking and Broadcast Technologies
Linear programming
Computer science
Simulated annealing
Genetic algorithms
Software maintenance
Software testing
Costs
Flow graphs
Software algorithms
Computational modeling
Language
ISSN
0730-3157
Abstract
The optimal regression testing problem is that of determining the minimum number of test cases needed for revalidating modified software in the maintenance phase. The present two natural optimization algorithms, namely simulated annealing and genetic algorithms, for solving this problem. The algorithms are based on an integer programming problem formulation and the program's control-flow graph. The main advantage of these algorithms is that they do not suffer from exponential explosion for realistic program sizes. The experimental results show that they find optimal or near-optimal number of retests in a reasonable time.