| 基于解空间树的组合测试数据生成 |
| |
| 引用本文： | 史亮,聂长海,徐宝文.基于解空间树的组合测试数据生成[J].计算机学报,2006,29(6):849-857. |
| |
| 作者姓名： | 史亮 聂长海 徐宝文 |
| |
| 作者单位： | 1. 东南大学计算机科学与工程学院,南京,210096
2. 东南大学计算机科学与工程学院,南京,210096;武汉大学软件工程国家重点实验室,武汉,430072 |
| |
| 基金项目： | 国家重点基础研究发展计划(973计划);中国科学院资助项目;江苏省自然科学基金 |
| |
| 摘 要： | 在组合覆盖测试模型的基础上提出：将所有的可用测试数据表示为一棵解空间树,利用回溯法对解空间树进行路径搜索来生成测试数据,然后使用贪心算法补充生成测试数据,以满足两两组合覆盖标准.并且实现了基于该方法的测试数据生成工具,所生成的测试数据集与同类工具相比具有一定的特点和优势.
|
| 关 键 词： | 软件测试 组合覆盖 测试数据生成 算法 软件工程 |
| 收稿时间： | 2004-11-09 |
| 修稿时间： | 2004-11-092006-03-03 |
Pairwise Test Data Generation Based on Solution Space Tree |
| |
| SHI Liang,NIE Chang-Hai,Xu Bao-Wen.Pairwise Test Data Generation Based on Solution Space Tree[J].Chinese Journal of Computers,2006,29(6):849-857. |
| |
| Authors: | SHI Liang NIE Chang-Hai Xu Bao-Wen |
| |
| Affiliation: | 1.School of Computer Science and Engineering, Southeast University, Nanjing 210096; 2.State Key Laboratory of Software Engineering, Wuhan University, Wuhan 430072 |
| |
| Abstract: | Pairwise testing is practical and effective for various types of software systems, and it is a key problem to generate test data for the pairwise coverage criterion. This paper represents all feasible test data as a solution space tree based on the combinatorial testing model, and suggests a backtrack approach to search a subset of paths in the tree for pairwise testing data generation. Then some test data may be added into the test data suite by a greedy algorithm to cover all the uncovered pairs. The authors have implemented a test generation tool based on the approach, and the empirical results show that the approach has some merits compared with the related works. |
| |
| Keywords: | software testing combinatorial coverage test data generation algorithm software engineering |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
