ISCAS OpenIR  > 基础软件与系统重点实验室
an efficient method to generate feasible paths for basis path testing
Jun Yan; Zhang Jian
2008
SourceInformation Processing Letters
Volume107Issue:3-4Pages:87-92
English AbstractBasis path testing is a very powerful structural testing criterion. The number of test paths equals to the cyclomatic complexity of program defined by McCabe. Traditional test generation methods select the paths either without consideration of the constraints of variables or interactively. In this note, an efficient method is presented to generate a set of feasible basis paths. The experiments show that this method can generate feasible basis paths for real-world C programs automatically in acceptable time.
Indexed Typeei
KeywordSoftware Engineering Basis Path Testing Path Feasibility Test Data Generation
Department计算机科学国家重点实验室
Language英语
WOS IDWOS:000257531300001
Citation statistics
Content Type期刊论文
URIhttp://ir.iscas.ac.cn/handle/311060/3132
Collection基础软件与系统重点实验室
Recommended Citation
GB/T 7714
Jun Yan,Zhang Jian. an efficient method to generate feasible paths for basis path testing[J]. Information Processing Letters,2008,107(3-4):87-92.
APA Jun Yan,&Zhang Jian.(2008).an efficient method to generate feasible paths for basis path testing.Information Processing Letters,107(3-4),87-92.
MLA Jun Yan,et al."an efficient method to generate feasible paths for basis path testing".Information Processing Letters 107.3-4(2008):87-92.
Files in This Item:
File Name/Size DocType Version Access License
2008107030487.pdf(126KB) 开放获取--Application Full Text
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Jun Yan]'s Articles
[Zhang Jian]'s Articles
Baidu academic
Similar articles in Baidu academic
[Jun Yan]'s Articles
[Zhang Jian]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Jun Yan]'s Articles
[Zhang Jian]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.