关键词: 动态符号执行, 约束求解, 路径覆盖, 遗传算法

Abstract:

Dynamic symbolic execution is an effective testing method. However, due to the limitation of the constraint solving capability, the path coverage of the dynamic symbol execution needs to be improved in the face of complicated programs and path conditions. To improve the path coverage of testing, this paper proposes a dynamic symbol execution method based on the assistance of genetic algorithm, and a prototype tool JDart-Ga is implemented based on the method. The proposed method leverages the advantages of the genetic algorithm to generate test inputs for the program path conditions that cannot be handled by the dynamic symbolic execution. The experimental results show that the path coverage of JDart-Ga is increased from 16% to 23% with respect to JDart, when testing 3 experimental programs that contain feasible path conditions cannot solved by the constraint solver.

Key words: dynamic symbolic execution, constraint solving, path coverage, genetic algorithm