分支测试中关键分支的寻找算法

摘要

The branch test has been proved to be the most cost-effective methods of structural testing, in the branch coverage process in determining the test case, through deeply investigating the properties of DD-figure, the algorithm of finding key branches based on the DD-graph generated from the dominant tree and the implied tree was proposed, it can easily and quickly find the smallest branch subset determining the coverage of the program branches, that is during program execution, the coverage of all branches as long as access to the executiving state of the key branch could be computed. The algorithm has a good time complexity and effectiveness,it has played a good role in improving the quality and efficiency of software testing.%分支测试被实践证明是目前性价比最高的结构性测试方法之一,在判断测试用例的分支覆盖过程中,通过深入研究DD图的性质,提出了一种基于生成的DD图对应的支配树和蕴含树基础上实现的关键分支寻找算法,能简便、快捷地找出判断程序分支覆盖的最小分支子集,即在程序执行过程中,只要获得关键分支的执行状况就可以计算出所有分支的覆盖情况.该算法具有良好的时间复杂度和有效性,对提高软件测试质量和效率,起到了较好的作用.