体现分支覆盖情况的基本路径集自动生成算法

An Automatic Generation Algorithm of Basic Path Set— Reflect the Situation of Branch Coverage

在软件测试中,各种基本路径自动生成算法已经在单元测试中得到充分运用,使得单元测试的效率得到了极大提高。但是这些基本路径自动生成算法生成的基本路径并不能直观反应它们对程序的覆盖情况。该文提出一种算法,它采用最短路径复用及分支结点逐个覆盖法,使得生成的基本路径最短,重要的是每条基本路径能显示它是为了覆盖哪个分支结点而存在。它能够减少测试者根据基本路经集设计测试用例的时间,从而提高单元及其回归测试效率。实践表明,此算法具有很好的应用效果,特别适用于自动化生成的测试用例不能满足覆盖率要求需要人工生成测试用例的复杂单元。

As all kinds of algorithms about the generation of basic path set have given plenty of exercise in the software testing,so that it improves the efficiency of unit testing greatly.But each basic path generated by those algorithms can't reflect which portions of the code have been covered intuitively.This article comes up with a new algorithm which can generate the shortest basic path for it adopts methods of reusing shortest path and covering branch node one by one.What's more,the basic path generated by this algorithm can reflect which branch node it has cover.This algorithm will help us narrow the time when we design the test case based on basic paths,and improve the efficiency of unit and regression testing.The practice shows that my algorithm has a good effect especially on complex units that need generate test cases artificially for the automatic generation of test cases cannot meet the coverage requirements.