Name
Abstract | ||
|---|---|---|
Dynamic symbolic execution has been shown to be an effective technique for automated test input generation. When applied to large-scale programs, its scalability however is limited due to the combinatorial explosion of the path space and the high cost of computation. Several sophisticated search strategies have been proposed to better guide dynamic symbolic execution towards achieving high code coverage. While confirmed effective, these techniques may deteriorate in practical situations because of the large computation cost involved. In this paper, we propose a search heuristic which is directed by coverage information and interleaved with random search to perform dynamic symbolic execution for coverage improvements and cost-effectiveness. We conducted two evaluations to evaluate the effectiveness of our proposed approach and to study the impact of computation costs on its practical capabilities.
|
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/IWAST.2012.6228993 | AST |
Keywords | Field | DocType |
automated test input generation,dynamic symbolic execution,software testing,combinatorial explosion,random search,code coverage,scalability,time measurement,cost effectiveness | Code coverage,Random search,Heuristic,Computer science,Real-time computing,Concolic testing,Symbolic execution,Combinatorial explosion,Computation,Scalability | Conference |
ISBN | Citations | PageRank |
978-1-4673-1822-8 | 1 | 0.36 |
References | Authors | |
8 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| TheAnh Do | 1 | 17 | 2.39 |
| Alvis Cheuk M. Fong | 2 | 465 | 44.35 |
| Russel Pears | 3 | 205 | 27.00 |