發(fā)布時間：2018-04-22 11:42

  本文選題：Cluster + searching�。� 參考：《自動化學報》2017年09期

【摘要】：The test suite generation is a key task for combinatorial testing of software. In order to generate high-quality testing data, a cluster searching driven global optimization mechanism is proposed. In this approach, a binary encoding mechanism is used to transform the combination test suite generating problem into a gene sequence optimization problem. Meanwhile, a novel global optimization algorithm, cluster searching algorithm(CSA), is developed to solve it. In this paper, the validity and rationality of problem transformation mechanism is verified, and the details of CSA are shown. The simulations illustrate the proposed mechanism is feasible. Moreover, it is a simpler and more efficient test suite generation approach for small-size combinatorial testing problems.
[Abstract]:The test suite generation is a key task for combinatorial testing of software. In order to generate high-quality testing data, a cluster searching driven global optimization mechanism is proposed. In this approach, a binary encoding mechanism is used to transform the combination test suite generating problem into a gene sequence optimization problem. Meanwhile, a novel global optimization algorithm, cluster searching algorithm(CSA), is developed to solve it. In this paper, the validity and rationality of problem transformation mechanism is verified, and the details of CSA are shown. The simulations illustrate the proposed mechanism is feasible. Moreover, it is a simpler and more efficient test suite generation approach for small-size combinatorial testing problems.
【作者單位】： School
【基金】：supported by the National Natural Science Foundation of China(61203311,61105064) the Scientific Research Program of Shaanxi Provincial Education Department of China(2015JK1672)
【分類號】：TP311.53

【相似文獻】

相關博士學位論文 前1條

1 馬曉普;角色工程中的角色與約束生成方法研究[D];華中科技大學;2011年

相關碩士學位論文 前1條

1 吳勛;基于組合匹配的成對組合測試數(shù)據(jù)生成[D];湖南大學;2009年

，

本文編號：1787067