• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IEEE Pacific Rim International Symposium on Dependable Computing >Generating High Strength Test Suites for Combinatorial Interaction Testing Using ZDD-Based Graph Algorithms
【24h】

Generating High Strength Test Suites for Combinatorial Interaction Testing Using ZDD-Based Graph Algorithms

机译：使用基于ZDD的图算法生成用于组合交互测试的高强度测试套件

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Combinatorial interaction testing is a well practiced method for detecting faults for various computing systems. This method requires that any t-wise parameter interactions must be exercised by at least one test case. The value of t is usually referred to as strength. A large body of research exists about constructing test suites of small or moderate strength, typically t = 2 or 3, but very few techniques are known for constructing those of very high strength. This paper proposes the use of ZDD-based graph algorithms to construct a very high strength combinatorial test suite. Constructing high strength test suites is challenging because of the large number of interactions that must be handled during test suite construction. A ZDD is a data structure that can be used to enumerate a very large number of paths in an undirected graph and to perform operations on large sets of graphs. In our approach test cases and interactions are represented as subgraphs of the same graph. Using a ZDDbased graph library to operate on the graphs, we succeeded in constructing test suites of high strength up to t = 11 for some problem instances.
机译：组合交互测试是一种用于检测各种计算系统故障的良好实践方法。此方法要求至少一个测试用例必须进行任何t方向参数交互。 t的值通常称为强度。关于构建强度较小或中等的测试套件（通常为t = 2或3），存在大量研究，但对于构​​建强度非常高的套件而言，知之甚少。本文提出使用基于ZDD的图形算法来构建非常高强度的组合测试套件。构建高强度的测试套件具有挑战性，因为在测试套件的构建过程中必须处理大量的交互。 ZDD是一种数据结构，可用于枚举无向图中的大量路径并在大图集上执行操作。在我们的方法中，测试用例和交互表示为同一图的子图。使用基于ZDD的图形库对图形进行操作，我们成功地为某些问题实例构建了强度最高为t = 11的测试套件。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号