.png){kind=icon}
返回
An enhanced zero-one optimal path set selection method
.png){kind=icon}
PRE
AI
DOI：10.1016/S0164-1212(96)00169-0.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
One issue in structural program testing is how to select a mimimal set of test paths to meet certain test requirements. This is referred to as the optimal path set selection problem. The previously proposed zero-one optimal path set selection method is a generalized method that can be applied to most coverage criteria. However, the major drawback of this method is that for a large program the computation may take ten or more hours because the computation is exponentially proportional to the number of candidate paths and proportional to the number of components to be covered. To alleviate the drawback, this paper enhances the method by (1) defining five reduction rules, and (2) reusing previously selected path sets to reduce both the number of candidate paths and the number of components to be covered. Since both the number of candidate paths and the number of components to be covered are reduced, the computation time can be greatly reduced. In addition, an efficient approach to handling infeasible paths is proposed. An evaluation of the enhanced zero-one method, the original zero-one method, and a greedy method is executed and the result is presented. (C) 1997 Elsevier Science Inc.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.1
论文数:
5.4K
被引数:
8.4K
机构
暂无机构信息
引用论文
.png){kind=icon}
Controlled partial embedding of carbon nanotubes within flexible transparent layers碳纳米管在柔性透明层内的受控部分嵌入
PREAI
分享收藏Construction of Seamless English Language Learning Cyberspace via Interactive Text Messaging Tool
OAAI
OAAI分享收藏 没有更多内容
没有更多内容