Buffer overrun detection using linear programming and static analysis
Vinod Ganapathy, Somesh Jha, David Chandler et al. · Proceedings of the ACM Conference on Computer and Communications Security · 2003
This paper addresses the issue of identifying buffer overrun vulnerabilities by statically analyzing C source code. We demonstrate a light-weight analysis based on modeling C string manipulations as a linear program. We also present fast, scalable solvers based on linear programming, and demonstrate techniques to make the program analysis context sensitive. Based on these techniques, we built a prototype and used it to identify several vulnerabilities in popular security critical applications.
Cited by 91 works. doi:10.1145/948109.948155
Authors
References
- Introduction to Algorithms
- Linear Programming and Extensions
- Network Flows: Theory, Algorithms, and Applications.
- Theory of Linear and Integer Programming
- Primal-Dual Interior-Point Methods
- Theory of Linear and Integer Programming
- StackGuard: Automatic Adaptive Detection and Prevention of Buffer-Overflow Attacks
- Smashing The Stack For Fun And Profit
- Efficiently computing static single assignment form and the control dependence graph
- Interprocedural slicing using dependence graphs