摘要： 路径覆盖是考察软件测试充分性的一种重要准则，它使程序的每个分支至少执行一次。该文通过对DDGRAPH图的定义及相关概念的分析，对构建DDGRAPH图及支配树、蕴含树、非限制弧的方法进行了改进。通过具体的应用实例对比了改进前后的方法，改进后的方法可以减少生成的路径数，用更少的测试用例发现更多的错误。
关键词:
路径覆盖,
支配树,
蕴含树,
非限制弧
Abstract: Path coverage is a kind of important standard that investigates the sufficiency of software testing, it requires that every branch in a program should be performed at least once. This paper analyses the definition of the DDGRAPH diagram and related concept, improves the method of designing the DDGRAPH diagram and the dominated tree, implied tree, unconstrained arc. Compared with the former method using an actual application case, the improved method can effectively reduce the number of generated paths, so it can use less test cases to find more errors.
Key words:
Path coverage,
Dominated tree,
Implied tree,
Unconstrained arc
侯 芸;顾 刚;高海昌;郭 斌. 一种路径覆盖自动生成的改进方法[J]. 计算机工程, 2007, 33(04): 67-69.
HOU Yun; GU Gang; GAO Haichang; GUO Bin. An Improved Method of Automatic Generation for Path Coverage[J]. Computer Engineering, 2007, 33(04): 67-69.