Abstract
Dynamic symbolic execution (DSE) is an efficient SMT-based path enumeration technique used in software testing. In this work in progress, we consider here the case of guided DSE, where the paths to enumerate should be part of a given program slice. We propose a new path selection criterion, which aims to minimize the number of queries to the SMT solvers. This criterion is based on the probability of a path to exit the program slice. Experiments show that this information can be computed in a reasonable time for DSE purpose.
Cite
CITATION STYLE
Feist, J., Mounier, L., & Potet, M. L. (2016). Guided dynamic symbolic execution using subgraph control-flow information. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9763, pp. 76–81). Springer Verlag. https://doi.org/10.1007/978-3-319-41591-8_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
