首页> 外文会议>IEEE International Conference on Communication Software and Networks >A reduction method of combinatorial testing based on input parameter constraints
【24h】

A reduction method of combinatorial testing based on input parameter constraints

机译:基于输入参数约束的组合测试简化方法

获取原文

摘要

Firstly, the definitions of software combination coverage test and several combinatorial coverage algorithms are briefly introduced, and the advantages and defects of the combinatorial testing methods are compared. Then the concepts of input parameters constraints are descripted in detail. At last, a method of reducing the combinatorial test case sets based on parameter constraint relations is presented, and the experimental results of the reducing method are shown. From the aspect of the test case number, the two reduction results of the full combinational test case and pairwise based on parameter constraints are compared in the experiment, and the test case number rates of after and before reducing are 39.1% and 80.7%, respectively.
机译:首先简要介绍了软件组合覆盖测试的定义和几种组合覆盖算法,比较了组合测试方法的优缺点。然后详细描述了输入参数约束的概念。最后提出了一种基于参数约束关系的组合测试用例集约简方法,并给出了约简方法的实验结果。从测试用例数量的角度,比较了组合测试用例和基于参数约束的成对测试的两种减少结果,减少后和之前的测试用例数量比率分别为39.1 \%和80.7 \% , 分别。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号