Test Case Reduction Method Based on Vector Similarity Algorithm

LIU Feng; LI Peng; ZHU Er-zhou

Chinese

您当前的位置：

首页 >

文章列表页 >

Test Case Reduction Method Based on Vector Similarity Algorithm

更新时间：2026-09-04

- Test Case Reduction Method Based on Vector Similarity Algorithm
- Vol. 34, Issue 3, Pages: 35-39(2017)
- 作者机构：
  
  安徽大学计算机科学与技术学院,安徽,合肥,230601
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：2017
- 稿件说明：
移动端阅览
刘锋, 李朋, 朱二周. 基于向量相似度的测试用例集约简方法[J]. 微电子学与计算机, 2017, 34(3): 35-39.

LIU Feng, LI Peng, ZHU Er-zhou. Test Case Reduction Method Based on Vector Similarity Algorithm[J]. 2017, 34(3): 35-39.
刘锋, 李朋, 朱二周. 基于向量相似度的测试用例集约简方法[J]. 微电子学与计算机, 2017, 34(3): 35-39. DOI：

LIU Feng, LI Peng, ZHU Er-zhou. Test Case Reduction Method Based on Vector Similarity Algorithm[J]. 2017, 34(3): 35-39. DOI：

摘要

测试用例集约简的目的是在保证原有测试用例集覆盖度不变的情况下

使用一定的方法策略

尽可能的缩减测试用例集的数量

从而达到提高软件测试效率、降低测试成本的目标.本文的向量相似度算法是先利用二元向量的相似性函数

然后计算出测试用例之间的相似度、覆盖度和冗余度

最后根据计算结果选择最佳测试用例

从而得到约简后的最优或近似最优测试用例集.通过实验表明

该算法与现有的GRE算法相比: 约简后测试用例集的数量平均降低约10%

而测试用例集总的冗余度平均降低约13%.

Abstract

The purpose of test suit reduction is to improve the efficiency of software testing and reduce the cost of test. At the same time

the coverage of the original test cases should be ensured invariable and the number of test cases could be reduced as possible with the use of a certain strategy. Vector similarity algorithm is that the binary vector similarity function should be used firstly

then the similarity

coverage and redundancy test cases needed be calculated

and the best test cases is selected according to the calculation result

finally we will get the optimal or approximate optimal test cases after the reduction. Compared with the existing algorithm of GRE

experiments show that the number of test cases decreased by about 10% averagely and the whole redundancy rate of test cases decreased by about 13% averagely according to the vector similarity algorithm.

关键词

Keywords

references

Zhang K, Chen H, Liu S, et al. Application of vector similarity method in multi-plan optimization[C]//IEEE International Conference on Information % Automation. China, Macau, 2015: 335-338.

Chen T Y, Lau M F. Dividing strategies for the optimization of a test suite[J]. Information Processing Letters, 1996, 60(3): 135-141. DOI: 135

马雪英, 盛斌奎, 叶澄清. 用遗传算法的测试用例最小化[J]. 计算机科学, 2007, 34(1): 285-288. DOI: 285

William B Frakes, Ricardo Baeza-yates. Information retrieval: data structures and algorithms[M]. USA, Prentice-Hall Inc, 2009: 420-441.

Harrold M J, Gupta R, Soffa M L. A methodology for controlling the size of a test suite[J]. ACM Transaction on Software Engineering and Methodology, 1993, 2(3): 270-285. DOI: 270

Michael W Berry, Murry Browne. Understanding search engines mathematical modeling and text retrieval[R]. USA, Mishawaka: University of Tennessee, 1999: 31-39.

聂长海, 徐宝文. 一种最小测试用例集生成方法[J]计算机学报, 2003, 26(12): 1690-1695. DOI: 1690

Chen T Y, Lau M F. A new heuristic for test suite reduction[J]. Information and Software Technology, 1998, 40(5/6): 347-354. DOI: 347

Chen S T Y, Lau M F. On the divide-and-conquer approach towards test suite reduction[J]. Information Sciences, 2003, 152(1): 89-119. DOI: 89

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Aerial small object detection algorithm based on improved RT-DETR

Steganography model guided by attention mechanism and improved dense convolution

A high-efficiency charge pump for ultra-low voltage boost systems

Simulation on the DC characteristics of double heterojunction p-GaN HEMT with AlN/GaN hybrid buffer layer

Monte carlo analysis of V-layout trench SiC neutron detector

Related Author

No data

Related Institution

No data

AI问答

Postal code：100079
Tel：（010）53879206 Email：tmw@bjxintong.com.cn
Technical support is provided by Beijing Founder electronics co., LTD 京ICP备09082226号-64 京公网安备11010602201714号
It is recommended to read the content of this site in Chrome&IE9+. Please switch to extreme mode in browser 360.
Cookies We use cookies to help provide and enhance our service and tailor content. By continuing, you agree to the use of cookies.

⁰