【24h】

A New Method for Test Suite Reduction

机译:减少测试套件的新方法

获取原文

摘要

Test suite reduction is to find a subset of the test suite containing a minimal number of test cases that can satisfy all test requirements. Test suite reduction techniques attempt to remove redundant test cases. Existed minimal set selection methods cannot guarantee the optimality of representative sets obtained. This paper adapts the Quine-McCluskey algorithm to find the minimal representative set. To demonstrate the applicability of the approach, we conduct an experimental comparison. The results show that the Quine-McCluskey approach can identify the optimal test suite. Meanwhile, the application of this method for testing the automatic fare collection systems of Shanghai Metro also validated that it is effective.
机译:减少测试套件是为了找到测试套件的子集,其中包含可以满足所有测试需求的最少数量的测试用例。测试套件缩减技术试图删除多余的测试用例。现有的最小集合选择方法不能保证所获得的代表性集合的最优性。本文采用Quine-McCluskey算法来找到最小代表集。为了证明该方法的适用性,我们进行了实验比较。结果表明,Quine-McCluskey方法可以确定最佳测试套件。同时,该方法在上海地铁自动收费系统测试中的应用也证明了该方法的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号