| 关于可应用测试数据充分性准则复杂性的注记 |
| |
| 引用本文： | 暴建民,王申科. 关于可应用测试数据充分性准则复杂性的注记[J]. 计算机学报, 1999, 22(4): 437-441 |
| |
| 作者姓名： | 暴建民 王申科 |
| |
| 作者单位： | 1. 中国科学院计算技术研究所CAD开放研究实验室,北京,100080
2. 中国建设银行科技部,北京,100032 |
| |
| 摘 要： | 软件测试充分性准则的复杂性分析对于测试效率的分析和比较具有重要意义，对于测试充分性准则使用具有指导意义，Ｗｅｙｕｋｅｒ于１９８４年提出了Ｒａｐｐｓ－Ｗｅｙｕｋｅｒ的ａｌｌ－ｕｓｅｓ，ａｌｌ－ｐ－ｕｓｅｓ／ｓｏｍｅ－ｃ－ｕｓｅｓ，ａｌｌ－ｃ－ｕｓｅｓ．ｓｏｍｅ－ｐ－ｕｓｅｓ和ａｌｌ－ｐ－ｕｓｅｓ准则的复杂性上界，于１９８８年又提出可应用数据流测试准则。我们发现原有测试复杂度在可应用家族中应用出现问题
|
| 关 键 词： | 软件测试 软件可靠性 数据流 测试准则 |
| 修稿时间： | 1998-01-05 |
THE NOTES ON THE COMPLEXITY OF APPLICABLE FAMILY OF DATA FLOW CRITERIA FOR TEST DATA SELECTION |
| |
| BAO Jian-Min,WANG Shen-Ke. THE NOTES ON THE COMPLEXITY OF APPLICABLE FAMILY OF DATA FLOW CRITERIA FOR TEST DATA SELECTION[J]. Chinese Journal of Computers, 1999, 22(4): 437-441 |
| |
| Authors: | BAO Jian-Min WANG Shen-Ke |
| |
| Abstract: | The complexity of data flow criterla for test data selection is very important to analysis and comparation of testing efficiency. In 1984, Weyuker proposed the complexity of RappsWeyuker all-uses, all-p-uses/some-c-uses,alluc-uses/someup-uses and all-p-uses criteria, in 1988,proposed an applicable Family of Data Flow Testing Criteria, however its complexity was not changed prospectively, the notes on it is given in this paper. |
| |
| Keywords: | Software testing software reliability data flow testing criteria |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
