Combining over- and under-approximating program analyses for automatic software testing
This dissertation attacks the well-known problem of path-imprecision in static program analysis. Our starting point is an existing static program analysis that over-approximates the execution paths of the analyzed program. We then make this over-approximating program analysis more precise for automa...
| Main Author: | |
|---|---|
| Published: |
Georgia Institute of Technology
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1853/24764 |