Paper Info
Title
Dynamic Symbolic Execution Guided by Data Dependency Analysis for High Structural Coverage.
Abstract
Dynamic symbolic execution has been shown to be an effective technique for automated test input generation. When applied to large-scale and complex programs, its scalability however is limited due to the combinatorial explosion of the path space. We propose to take advantage of data flow analysis to better perform dynamic symbolic execution in the context of generating test inputs for maximum structural coverage. In particular, we utilize the chaining mechanism to (1) extract precise guidance to direct dynamic symbolic execution towards exploring uncovered code elements and (2) meanwhile significantly optimize the path exploration process. Preliminary experiments conducted to evaluate the performance of the proposed approach have shown very encouraging results.
Year
DOI
Venue
2012
10.1007/978-3-642-45422-6_1
Communications in Computer and Information Science
Keywords
Field
DocType
Dynamic Symbolic Execution,Automated Test Input Generation,Software Testing,Data Flow Analysis
Data mining,Chaining,Data dependency analysis,Computer science,Data-flow analysis,Theoretical computer science,Concolic testing,Symbolic execution,Computer engineering,Combinatorial explosion,Software testing,Scalability
Conference
Volume
ISSN
Citations 
410
1865-0929
4
PageRank 
References 
Authors
0.37
17
3
Name
Order
Citations
PageRank
TheAnh Do1172.39
Alvis Cheuk M. Fong246544.35
Russel Pears320527.00