Abstract
Dynamic symbolic execution has been shown an effective technique for automated test input generation. However, its scalability 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.
Keywords
Dynamic Symbolic Execution; Automated Test Input Generation; Software Testing; Data Flow Analysis
Date
2012
Source
ENASE 2012 : 7th International Conference on Evaluation of Novel Approaches to Software Engineering , Wroclaw, Poland, 2012-06-29 to 2012-06-30, published in: ENASE 2012 - Proceedings of the 7th International Conference, pp.5 - 12
Item Type
Conference Contribution
Publisher
DBLP
Rights Statement
DBLP: Copyright © 1993-2013 by Michael Ley (University of Trier, Informatik, ley@uni-trier.de) and Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH. The data provided by DBLP on its webpages as well as the XML files available at our website are released under the Open Data Commons Attribution License (ODC-BY 1.0). You are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data as long as you attribute any public use of the data, or works produced from the data, in the manner specified in the license. Read the full ODC-BY 1.0 license text for the exact terms that apply. The ODC-BY 1.0 license is courtesy of the Open Knowledge Foundation.
