Dividing Strategies for the Optimization of a Test Suite
暂无分享,去创建一个
Use of the divide-and-conquer approach to optimize a test suite does not guarantee that the optimal solutions could be re-constructed from those of the sub-problems. This paper investigates how the re-construction could be achieved with two dividing strategies. Results of a simulation study are also reported.
[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[2] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.
[3] Mary Lou Soffa,et al. A methodology for controlling the size of a test suite , 1993, TSEM.