Tree Based Test Case Generation and Cost Calculation Strategy for Uniform Parametric Pairwise Testing

摘要: Problem statement: Although it is very important to test any system extensively usually too expensive do so owing the cost and resources that are involved in it. Software testing a phase of software development ensure developed reliable. Some systematic approach for essential make acceptable. Combinatorial interaction one which tests all possible interactions. This could be at various levels such as two way (pairwise) or three four five six had been used several fields. It was reported literature pairwise combinatorial identified most faults. Approach: In this study we proposed new strategy suite generation, tree generation testing, with parameters equal values. The algorithm considered parameter time systematically generate until were considered. calculation technique iteratively each leaf nodes combinations covered. Results: experimental data showed achieved about 88% (or more some cases) reduction number cases needed complete testing. Conclusion: Thus, significant minimizing generated.