State space reduction for dynamic symbolic execution
Abstract/Contents
- Abstract
- Many recent tools use dynamic symbolic execution to perform tasks ranging from automatic test generation, finding security flaws, equivalence verification, and exploit generation. However, while symbolic execution is promising, it perennially struggles with the fact that the number of paths in a program increases roughly exponentially with both code and input size. This dissertation presents a technique that attacks this problem by eliminating paths that cannot reach new code before they are executed and evaluates it on 63 system intensive, complicated, and widely-used programs. Experiments demonstrate that the analysis speeds up dynamic symbolic execution by an average of 115.9 X, with a median of 10.5 X, and increases coverage by an average of 5.2 %.
Description
| Type of resource | text |
|---|---|
| Form | electronic; electronic resource; remote |
| Extent | 1 online resource. |
| Publication date | 2014 |
| Issuance | monographic |
| Language | English |
Creators/Contributors
| Associated with | Bugrara, Suhabe |
|---|---|
| Associated with | Stanford University, Department of Computer Science. |
| Primary advisor | Engler, Dawson R |
| Thesis advisor | Engler, Dawson R |
| Thesis advisor | Aiken, Alexander |
| Thesis advisor | Dill, David L |
| Advisor | Aiken, Alexander |
| Advisor | Dill, David L |
Subjects
| Genre | Theses |
|---|
Bibliographic information
| Statement of responsibility | Suhabe Bugrara. |
|---|---|
| Note | Submitted to the Department of Computer Science. |
| Thesis | Thesis (Ph.D.)--Stanford University, 2014. |
| Location | electronic resource |
Access conditions
- Copyright
- © 2014 by Suhabe Bugrara
- License
- This work is licensed under a Creative Commons Attribution Non Commercial 3.0 Unported license (CC BY-NC).
Also listed in
Loading usage metrics...