| Software testing is an important part of software development. It is also an essential means to ensure the quality of software and to improve the reliability of software. Due to the development of information technology, the scale and complexity of software keep on increasing. As a result, software testing gradually consumes more and more resources. To obtain the best testing result with the least cost is one of the most important issue in testing. It is proved that pair-wise testing is a practical and effective way to test all kinds of software systems.Extensive researches have been made on the generation of pair-wise testing. There are six main algorithms on that, Orthogonal arrays, AETG algorithm, IPO algorithm, Williams'algorithm, PSST algorithm and Kobayashi's algorithm. Compared with other six algorithms, IPO algorithm is based on parameters and can ensure the optimization of test cases in each expansion. Though IPO algorithm has a lot of advantages, it still has several defects which affects its performance. For instance, the horizontal growth of pair-wise testing, the combination of pair-wise testing cases and the extension sequence of the parameters to be extended all affect its performance.After analyzing and summarizing the merits and defects of pair-wise testing, we propose a HIPO algorithm based on IPO algorithm to solve those problems. The HIPO algorithm inherits the advantage of high extension of the IPO algorithm. And it introduces the contribution extent of testing cases which provides the basis for judging testing cases. Meanwhile, the HIPO algorithm adopts the methods of preferential sequence as well as minimization algorithm to optimize the problems above. As a result, it performs much better.We develop the test case generation tool based on the HIPO algorithm by means of .net technology. We prove its effectiveness in the following experiment. The HIPO algorithm was used in the anti-money laundering system and generates a better result. |
PDF Full Text Request