Automated test generation on path-based symbolic execution

This paper describes the path-based symbolic execution of programs in order to solve the “path-storm” problem in traditional symbolic execution. Instead of using execution tree, execution digraph is used, and the program execution is simplified by clustering the execution of loops, and decrease the paths generated from the execution of loops by classifying the constraints. The verification and analysis of path-based symbolic execution algorithm are included.