首页> 外文会议>International Conference on Intelligent Computing and Control Systems >Weighted Rank Ant Colony Metaheuristics Optimization Based Test Suite Reduction in Combinatorial Testing for Improving Software Quality
【24h】

Weighted Rank Ant Colony Metaheuristics Optimization Based Test Suite Reduction in Combinatorial Testing for Improving Software Quality

机译:加权等级蚁群化培育学基于基于测试套件的组合测试改进软件质量

获取原文

摘要

Software Product Lines (SPLs) contains a large number of feature combinations therefore pose challenges for testing software application program. In combinatorial testing, pair wise coverage maximization and test suite reduction plays a major role to reduce the testing cost of software program application. Few research works have been developed for combinatorial testing using different test suite reduction techniques. But, the conventional genetic algorithm does not present an optimal solution for test suite optimization problem because of process of randomly mutating bits of chromosome in mutation operation. In addition to that, genetic algorithm requires more computational time. In order to solve this limitation, Weighted Rank Ant Colony Metaheuristic Test Suite Optimization (WRACMTSO) Technique is proposed. WRACMTSO Technique designed a Weighted Rank Ant Colony Metaheuristic Optimization algorithm for test suite reduction in combinatorial testing. The WRACMO algorithm begins with initialization of ACO parameters with help of test cases in test suite. Then, ant chooses the one of two vertices to reach food source using trail's probability with weighted rank value and consequently updates pheromone trails. This process is repetitive until the ant attains food source. In WRACMO algorithm, vertices (test cases) elected by an ant to arrive at the food source are considered as optimal for performing combinatorial testing. By using this process, WRACMTSO Technique efficiently optimizes the test cases in test suite with minimum time. Therefore, WRACMTSO Technique enhances the test suite reduction rate and reducing the computational time of test cases for efficient combinatorial testing. The WRACMTSO Technique conducts the experimental works on metrics such as test suite reduction rate, computational time, testing cost and coverage rate with respect to different number of test suite and size of software product lines.
机译:软件产品线(SPL)包含大量特征组合,因此对测试软件应用程序的挑战构成挑战。在组合测试中,一对明智的覆盖率最大化和测试套件减少起到了最大的作用,以降低软件程序应用的测试成本。使用不同的测试套件减少技术,已经为组合测试开发了很少的研究作品。但是,由于在突变操作中随机突变染色体的方法,传统的遗传算法对测试套件优化问题没有最佳解决方案。除此之外,遗传算法还需要更多的计算时间。为了解决这一限制,提出了加权秩蚁群化成血管测试套件优化(WRACMTSO)技术。 WRACMTSO技术设计了一种加权等级蚁群地区培养算法,用于组合测试的试验套件。 WRACMO算法始于ACO参数的初始化,以及测试套件的测试用例的帮助。然后,Ant选择两个顶点中的一个,以使用Trail的加权等级值概率到达Food源,并因此更新信息素路径。这一过程是重复的,直到蚂蚁达到食物来源。 In WRACMO algorithm, vertices (test cases) elected by an ant to arrive at the food source are considered as optimal for performing combinatorial testing.通过使用此过程,WRACMTSO技术有效地优化了测试套件中的测试用例,最短时间。因此,WRACMTSO技术提高了测试套件减少率,降低了测试用例的计算时间,以实现有效的组合测试。 WRACMTSO技术对测量标准进行实验工作,例如测试套件减少率,计算时间,测试成本和覆盖率相对于不同数量的测试套件和软件产品线的大小。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号