Abstract: Now many redundant test cases occur in coverage test. This paper introduces an improved coverage test tool based on global domination graph algorithm, the algorithm is an improved algorithm through adding the annotated looping tree and finding nearest common node. It can compute the minimum test case set which covers the source code. Experimental result shows that the algorithm can decrease the analysis time of coverage result file, generate small test case, and achieves high coverage rate.

Key words: coverage test, global domination graph algorithm, test case, program flow graph, code instrumentation

摘要： 目前的覆盖测试存在着大量的冗余测试用例，严重影响测试的效率。基于此，介绍一种基于全局支配图算法的覆盖测试工具，通过在局部支配图中加入辅助循环树算法及寻找临近节点，提出一种全局支配图改进算法，利用该算法能够计算出覆盖源程序的最小测试用例集。实验结果表明，该算法能够减少覆盖分析时间，生成较少的测试用例和达到较高的覆盖率。

关键词: 覆盖测试, 全局支配图算法, 测试用例, 程序流图, 代码插装

CLC Number: 

• TP311