Improving dynamic analysis with data flow analysis
| dc.contributor.advisor | Lin, Yun Calvin | en |
| dc.contributor.committeeMember | McKinley, Kathryn | en |
| dc.contributor.committeeMember | Browne, James C. | en |
| dc.contributor.committeeMember | Khurshid, Sarfraz | en |
| dc.contributor.committeeMember | Myers, Andrew | en |
| dc.creator | Chang, Walter Chochen | en |
| dc.date.accessioned | 2010-10-26T15:01:44Z | en |
| dc.date.available | 2010-10-26T15:01:44Z | en |
| dc.date.available | 2010-10-26T15:01:51Z | en |
| dc.date.issued | 2010-08 | en |
| dc.date.submitted | August 2010 | en |
| dc.date.updated | 2010-10-26T15:01:51Z | en |
| dc.description | text | en |
| dc.description.abstract | Many challenges in software quality can be tackled with dynamic analysis. However, these techniques are often limited in their efficiency or scalability as they are often applied uniformly to an entire program. In this thesis, we show that dynamic program analysis can be made significantly more efficient and scalable by first performing a static data flow analysis so that the dynamic analysis can be selectively applied only to important parts of the program. We apply this general principle to the design and implementation of two different systems, one for runtime security policy enforcement and the other for software test input generation. For runtime security policy enforcement, we enforce user-defined policies using a dynamic data flow analysis that is more general and flexible than previous systems. Our system uses the user-defined policy to drive a static data flow analysis that identifies and instruments only the statements that may be involved in a security vulnerability, often eliminating the need to track most objects and greatly reducing the overhead. For taint analysis on a set of five server programs, the slowdown is only 0.65%, two orders of magnitude lower than previous taint tracking systems. Our system also has negligible overhead on file disclosure vulnerabilities, a problem that taint tracking cannot handle. For software test case generation, we introduce the idea of targeted testing, which focuses testing effort on select parts of the program instead of treating all program paths equally. Our “Bullseye” system uses a static analysis performed with respect to user-defined “interesting points” to steer the search down certain paths, thereby finding bugs faster. We also introduce a compiler transformation that allows symbolic execution to automatically perform boundary condition testing, revealing bugs that could be missed even if the correct path is tested. For our set of 9 benchmarks, Bullseye finds bugs an average of 2.5× faster than a conventional depth-first search and finds numerous bugs that DFS could not. In addition, our automated boundary condition testing transformation allows both Bullseye and depth-first search to find numerous bugs that they could not find before, even when all paths were explored. | en |
| dc.description.department | Computer Science | |
| dc.format.mimetype | application/pdf | en |
| dc.identifier.uri | http://hdl.handle.net/2152/ETD-UT-2010-08-1586 | en |
| dc.language.iso | eng | en |
| dc.subject | Data flow | en |
| dc.subject | Software testing | en |
| dc.subject | Software security | en |
| dc.subject | Dynamic analysis | en |
| dc.subject | Static analysis | en |
| dc.subject | Test input generation | en |
| dc.title | Improving dynamic analysis with data flow analysis | en |
| dc.type.genre | thesis | en |
| thesis.degree.department | Computer Sciences | en |
| thesis.degree.discipline | Computer Sciences | en |
| thesis.degree.grantor | University of Texas at Austin | en |
| thesis.degree.level | Doctoral | en |
| thesis.degree.name | Doctor of Philosophy | en |