摘要
路径覆盖是路径测试最重要的课题之一。文章给出了ddgraph图的支配树、蕴含树和非限制弧的构造方法,提出了一种基于最小路径测试子集的寻找单个测试路径算法,该算法可有效地生成从入口到出口且覆盖非限制弧的路径子集,并给出了具体的应用实例。
Path coverage is one of the most important topics of the path testing research.This paper gives the con-struction method of dominance tree,implication tree and unconstrained arcs in ddgraph,and presents a FIND_A_PATH algorithm based on minimum number of paths testing subset.It can constructs the path subset from entry to exit,using unconstrained arcs,and an example is given in this paper.
出处
《计算机工程与应用》
CSCD
北大核心
2003年第16期123-125,共3页
Computer Engineering and Applications
基金
黑龙江省教育厅科技项目(编号:10513011)
哈尔滨师范大学基金项目资助