A Novel Generation Algorithm of Pair-Wise Testing Cases

Pair-wise testing is a practical and effective method which has already been used in the software testing. Extensive research has been made on the generation of pair-wise testing. In order to make it easy to analyze the current generation methods, we propose a method to ease the process. That is we transform the problem of pair-wise testing to a graphic one. The IPO algorithm is based on parameters and can ensure the optimization of test cases in each expansion. Though it has many advantages, it is still not sustainable enough because of its flexibility. We studied the three elements which affect its sustainability. The three elements are the horizontal growth of pair-wise testing, the combination of pair-wise testing cases and the extension sequence of the parameters to be extended. Thus we propose a HIPO algorithm based on IPO algorithm to solve those problems. The HIPO algorithm inherits the merits of high extension of IPO algorithm and introduces a new concept of contribution extent. It adopts the methods of preferential sequence as well as minimization algorithm to optimize the problems above. We develop the test case generation tool based on the HIPO algorithm by means of .Net technology. And we also prove its effectiveness in our experiment.