• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International journal of open source software & processes >Optimization Driven Constraints Handling in Combinatorial Interaction Testing
【24h】

Optimization Driven Constraints Handling in Combinatorial Interaction Testing

机译：组合交互测试中的优化驱动约束处理

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The combinatorial strategy is useful in the reduction of the number of input parameters into a compact set of a system based on the combinations of the parameters. This strategy can be used in testing the behaviour that takes place when the events are allowed to be executed in an appropriate order. Basically, in the software systems, for the highly configurable system, the input configurations are based on the constraints, and the construction of this idea undergoes various kinds of difficulties. The proposed Jaya-Bat optimization algorithm is developed with the combinatorial interaction test cases in an effective manner in the presence of the constraints. The proposed Jaya-Bat based optimization algorithm is the integration of the Jaya optimization algorithm (JOA) and the Bat optimization algorithm (BA). The experimentation is carried out in terms of average size and the average time to prove the effectiveness of the proposed algorithm. From the results, it is clear that the proposed algorithm is capable of selecting the test cases optimally with better performance.
机译：组合策略可用于根据参数的组合将输入参数的数量减少到系统的紧凑集合中。此策略可用于测试允许以适当顺序执行事件时发生的行为。基本上，在软件系统中，对于高度可配置的系统，输入配置是基于约束的，并且该思想的构造会遇到各种困难。提出的Jaya-Bat优化算法是在存在约束的情况下，以组合方式的交互测试案例进行有效开发的。提出的基于Jaya-Bat的优化算法是Jaya优化算法（JOA）和Bat优化算法（BA）的集成。在平均大小和平均时间方面进行了实验，证明了所提算法的有效性。从结果可以明显看出，所提出的算法能够以更好的性能最优地选择测试用例。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号