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. |
Year | DOI | Venue |
---|---|---|
2016 | 10.1007/978-3-319-41591-8_6 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Program slicing,Work in process,Computer science,Enumeration,Control flow,Theoretical computer science,Selection criterion,Symbolic execution,Software testing | Conference | 9763 |
ISSN | Citations | PageRank |
0302-9743 | 3 | 0.36 |
References | Authors | |
9 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Josselin Feist | 1 | 86 | 4.79 |
Laurent Mounier | 2 | 1187 | 79.54 |
Marie-Laure Potet | 3 | 190 | 21.34 |