Tackling the Path Explosion Problem in Symbolic Execution-driven Test Generation for Programs
Symbolic techniques have been shown to be very effective in path-based test generation; however, they fail to scale to large programs due to the exponential number of paths to be explored. In this paper, we focus on tackling this path explosion problem and propose search strategies to achieve quick branch coverage under symbolic execution, while exploring only a fraction of paths in the program. We present a reachability-guided strategy that makes use of the reachability graph of the program to explore unvisited portions of the program and a conflictdriven backtracking strategy that utilizes conflict analysis to perform nonchronological backtracking. We present experimental evidence that these strategies can significantly reduce the search space and improve the speed of test generation for programs.
Symbolic execution software testing conflict analysis.
Saparya Krishnamoorthy Michael S. Hsiao Loganathan Lingappan
Department of Electrical and Computer Engineering, Virginia Tech, Blacksburg, Virginia 24061, USA Intel Corporation, Folsom, California 95630, USA
国际会议
2010 19th IEEE Asian Test Symposium(第19届IEEE亚洲测试技术学术会议 ATS 2010)
上海
英文
59-64
2010-12-01（万方平台首次上网日期，不代表论文的发表时间）