首页 | 本学科首页   官方微博 | 高级检索  
     

基于DDGRAPH图的路径覆盖研究
引用本文:丁雪梅,伦立军.基于DDGRAPH图的路径覆盖研究[J].微机发展,2004,14(3):29-31.
作者姓名:丁雪梅  伦立军
作者单位:哈尔滨师范大学计算机科学系,哈尔滨师范大学计算机科学系 黑龙江哈尔滨150080,黑龙江哈尔滨150080
基金项目:黑龙江省教育厅科技项目(10513011)
摘    要:软件测试分为静态分析、路径选择、测试数据生成和动态分析四个阶段,而路径选择的自动生成是软件测试的关键技术之一。路径覆盖是软件测试中一种十分重要的方法,它使程序的每个分支至少执行一次。文中通过对DDGRAPH图的分析,提出了DDGRAPH图中弧的支配树和蕴含树的表示方法,然后给出由支配树和蕴含树确定非限制弧的方法,通过近似最少谓词覆盖策略以确定覆盖所有非限制弧的路径测试子集。

关 键 词:软件测试  路径覆盖  DDGRAPH图  非限制弧
文章编号:1005-3751(2004)03-0029-03
修稿时间:2003年7月29日

Research on Path Coverage Based on DDGRAPH
DING Xue-mei,LUN Li-jun.Research on Path Coverage Based on DDGRAPH[J].Microcomputer Development,2004,14(3):29-31.
Authors:DING Xue-mei  LUN Li-jun
Abstract:There are four phases in software testing:static analysis, path selection, test data generation and dynamic analysis. Automation generation of path selection is one of the key techniques in software testing. Path coverage is a very important method in software testing. It requires that every branch in a program be exercised at least once. In this article, program structure is analyzed using a DDGRAPH, dominance tree and implication tree between the arcs of a DDGRAPH are introduced. DT and IT make it possible to identify unconstrained arc. With near minimum predicate coverage strategy, can state that a test path subset that covers all unconstrained edges.
Keywords:software testing  path coverage  DDGRAPH  unconstrained arc
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号