A METHOD FOR SOFTWARE TESTING BASED ON DETERMINISTIC FINITE AUTOMATA MACHINE

被引:0
作者
Mao, Hong Mei [1 ]
Cai, Hong [1 ]
机构
[1] Nanchang Hangkong Univ, Sch Informat Engn, Nanchang, Jiangxi, Peoples R China
来源
3RD INTERNATIONAL SYMPOSIUM ON INFORMATION ENGINEERING AND ELECTRONIC COMMERCE (IEEC 2011), PROCEEDINGS | 2011年
关键词
software testing; path coverage testing; loop edge; deterministic finite automata machine;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this article, a path coverage testing method based on deterministic finite automata machine is proposed after analyzing current software testing methods. Deterministic finite automata machine and loop edge is introduced to perform the change between source program and path coverage testing. The experiment shows that the new method can reduce the number of generated paths to satisfy testing goal.
引用
收藏
页码:222 / 224
页数:3
相关论文
共 4 条
[1]   How many paths are needed for branch testing? [J].
Bertolino, A ;
Marre, M .
JOURNAL OF SYSTEMS AND SOFTWARE, 1996, 35 (02) :95-106
[2]  
Lin Hua-hui, 2006, J U SCI TECHNOLOGY C, V2, P225
[3]  
Lun Li-jun, 2004, MICROCOMPUTER DEV, V3, P29
[4]  
Mao Hong-mei, 2008, Computer Engineering and Applications, V44, P93, DOI 10.3778/j.issn.1002-8331.2008.30.028