东南大学学报（英文版）2018，Vol.34Issue(1)：28-35,8.DOI:10.3969/j.issn.1003-7985.2018.01.005
基于ILP和GA的时间感知测试用例优先排序混合算法
A hybrid algorithm based on ILP and genetic algorithm for time-aware test case prioritization
摘要
Abstract
To solve the problem of time-aware test case prioritization, a hybrid algorithm composed of integer linear programming and the genetic algorithm ( ILP-GA) is proposed. First, the test case suite which can maximize the number of covered program entities and satisfy time constraints is selected by integer linear programming. Secondly, the individual is encoded according to the cover matrices of entities, and the coverage rate of program entities is used as the fitness function and the genetic algorithm is used to prioritize the selected test cases. Five typical open source projects are selected as benchmark programs. Branch and method are selected as program entities, and time constraint percentages are 25% and 75%. The experimental results show that the ILP-GA convergence has faster speed and better stability than ILP-additional and ILP-total in most cases, which contributes to the detection of software defects as early as possible and reduces the software testing costs.关键词
测试用例优先排序/整数线性规划/遗传算法/时间约束Key words
test case prioritization/integer linear programming(ILP)/genetic algorithm/time constraint分类
信息技术与安全科学引用本文复制引用
孙家泽,王刚..基于ILP和GA的时间感知测试用例优先排序混合算法[J].东南大学学报（英文版）,2018,34(1):28-35,8.基金项目
The Natural Science Foundation of Education Minis-try of Shaanxi Province(No.15JK1672),the Industrial Research Project of Shaanxi Province(No.2017GY-092) （No.15JK1672）
Special Fund for Key Disci-pline Construction of General Institutions of Higher Education in Shaanxi Province. （）
