作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

›› 2003, Vol. 29 ›› Issue (08): 66-.

• 论文 • 上一篇    下一篇

路径覆盖构造方法

伦立军,赵辰光,丁雪梅,李英梅   

  1. 哈尔滨师范大学计算机科学系,哈尔滨师范大学科学技术处,哈尔滨师范大学计算机科学系,哈尔滨师范大学计算机科学系 哈尔滨 150080, 哈尔滨 150080, 哈尔滨 150080, 哈尔滨 150080
  • 发布日期:2003-04-25

Construction Method of Path Coverage

LUN Lijun1,ZHAO Chenguang2,DING Xuemei1,LI Yingmei1   

  1. (1.Department of Computer Science,Harbin Normal University,Harbin 150080; 2.Department of Science and Technology, Harbin Normal University,Harbin 150080)
  • Published:2003-04-25

摘要: 确定覆盖路径的测试数据范围是评估路径测试的重要课题之一。提出利用非限制弧集确定覆盖ddgraph图所有路径的子集,然后利用βbranch简化非限制弧,并给出了具体的应用实例。

关键词: Ddgraph, 路径覆盖, 非限制弧, βbranch

Abstract: A bound on the number of test data needed to achieve path coverage is important to evaluate the effort needed to test a given program. This paper presents an unconstrained arcs based on path testing subset in ddgraph, then simplify unconstrained arcs using βbranch , an example is given in this paper.

中图分类号: