Download now Free registration required
Recently there has been great success in using symbolic execution to automatically generate test inputs for small software systems. A primary challenge in scaling such approaches to larger programs is the combinatorial explosion of the path space. It is likely that sophisticated strategies for searching this path space are needed to generate inputs that effectively test large programs (by, e.g., achieving significant branch coverage). The authors present several such heuristic search strategies, including a novel strategy guided by the control flow graph of the program under test.
- Format: PDF
- Size: 80.4 KB