|
|||||
|
|
| 一种改进的转换可执行分析测试序列生成算法 | |
| 引用本文： | 赵保华,陈波,屈玉贵. 一种改进的转换可执行分析测试序列生成算法[J]. 中国科学技术大学学报, 2007, 37(9): 1096-1100 |
| 作者姓名： | 赵保华 陈波 屈玉贵 |
| 作者单位： | 中国科学技术大学,计算机系,安徽合肥,230027 |
| 基金项目： | 国家自然科学基金;国家自然科学基金;国家重点基础研究发展计划(973计划);国家重点实验室基金 |
| 摘 要： | 为确保测试序列对控制流和数据流的覆盖,提出了一种对以扩展有限状态机(extended finitestate machine,EFSM)为模型描述的协议进行测试的方法.该方法在控制流部分采用惟一输入输出(unique input/output,UIO)序列,在数据流部分采用全定义-使用路径(all Def-use paths)标准,通过改进的转换可执行分析(transition executability analysis,TEA)方法,使用深度优先策略生成TEA树,同时得到可执行的EFSM控制流和数据流测试序列以及所有变量的定义-使用对(Def-use pairs). |
| 关 键 词： | 协议测试 扩展有限状态机 转换可执行分析 |
| 文章编号： | 0253-2778（2007）09-1096-05 |
| 修稿时间： | 2006-07-10 |
A test sequence generation algorithm based on improved transition executability analysis |
|
| ZHAO Bao-hua,CHEN Bo,QU Yu-gui. A test sequence generation algorithm based on improved transition executability analysis[J]. Journal of University of Science and Technology of China, 2007, 37(9): 1096-1100 | |
| Authors: | ZHAO Bao-hua CHEN Bo QU Yu-gui |
| Affiliation: | Department of Computer Science and Technology, USTC , He f ei 230027, China |
| Abstract: | A method for testing protocols modeled by EFSM(extended finite state machine) was proposed,which can insure both the control flow and data flow to be covered by test sequences.The method uses UIO(unique input/output) sequences for control flow and all Def-use paths criterion for data flow.By means of improved transition executability analysis and extending a TEA(transition executability analysis) tree with depth-first strategy,it can generate executable test sequences both for control flow and data flow,as well as the Def-use pairs of all variables. |
| Keywords: | protocol test extended finite state machine transition executability analysis |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |