Buffer overrun detection using linear programming and static analysis

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2003, Pages 345-354

  Ganapathy, Vinod ^a   Jha, Somesh ^a   Chandler, David ^b   Melski, David ^b   Vitek, David ^b  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

^b GRAMMATECH INC   (United States)

Author keywords

Buffer overruns; Linear programming; Static analysis

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; CONTEXT SENSITIVE GRAMMARS; OPTIMIZATION; PROGRAM DEBUGGING; RELIABILITY; SECURITY OF DATA; SOFTWARE ENGINEERING;

BUFFER OVERRUNS; DECRYPTING; LANGUAGE CONSTRUCTS AND FEATURES; STATIC ANALYSIS;

LINEAR PROGRAMMING;

EID: 3142582577     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/948152.948155     Document Type: Conference Paper

References (34)

1. bugtraq.www.securityfocus.com.
2. CERT/CC advisories, www.cert.org/advisories.
3. The twenty most critical internet security vulnerabilities. www.sans.org/top20.
4. Aleph-one. Smashing the stack for fun and profit. Nov 1996. Phrack Magazine.
5. Technical analysis of remote sendmail vulnerability. www.securityfocus. com/archive/1/313757.
6. L. O. Andersen. Program Analysis and Specialization for the C Programming Language. PhD thesis, DIKU, Univ. of Copenhagen, 1994. (DIKU report 94/19).
7. E. D. Anderson and K. D. Anderson. Presolving in linear programming. Mathematical Prog., 71(2):221-245, 1995.
8. R. Bodik, R. Gupta, and V. Sarkar. ABCD: Eliminating array-bounds checks on demand. In ACM Conf. on Prog. Lang. Design and Impl. (PLDI), 2000.
9. J. W. Chinnek and E. W. Dravinieks. Locating minimal infeasible constraint sets in linear programs. ORSA Journal on Computing, 3(2):157-168, 1991.
10. st Intl. Conf. on Distributed Computing Systems (ICDCS), 2001.
11. J. Condit, M. Harren, S. McPeak, G. C. Necula, and W. Weimer. CCured in the Real World. In ACM Conf. on Prog. Lang. Design and Impl. (PLDI), 2003.
12. T. H. Cormen, C. E. Lieserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2001.
13. th USENIX Sec. Symp., 1998.
14. th USENIX Sec. Symp., 2003.
15. R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Trans. on Prog. Lang. and Systems (TOPLAS), 13(4):452-490, 1991.
16. G. B. Dantzig and B. Curtis Eaves. Fourier-Motzkin elimination and its dual. Journal of Combinatorial Theory (A), 14:288-297, 1973.
17. N. Dor, M. Rodeh, and M. Sagiv. CSSV: Towards a realistic tool for statically detecting all buffer overflows in C. In ACM Conf. on Prog. Lang. Design and Impl. (PLDI), 2003.
18. H. Etoh and K. Yoda. Protecting from stack-smashing attacks. 2000. www.trl.ibm.com/projects/security/ssp/main.html.
19. V. Ganapathy, S. Jha, D. Chandler, D. Melski, and D. Vitek. Buffer overrun detection using linear programming and static analysis. 2003. UW-Madison Comp. Sci. Tech. Report 1488. ftp://ftp.cs.wisc.edu/pub/tech-reports/reports/ 2003Ar1488.ps.Z
20. S. Horwitz, T. Reps, and D. Binkley. Interprocedural slicing using dependence graphs. ACM Transactions on Prog. Lang.s and Systems (TOPLAS), 12(1):26-60, 1990.
21. nd ACM Symp. on Foundations of Soft. Engg. (FSE), pages 11-20, New York, 1994.
22. th USENIX Sec. Symp., 2001.
23. th USENIX Sec. Symp., 2003.
24. G. C. Necula, S. McPeak, and W. Weimer. CCured: type-safe retrofitting of legacy code. In ACM Conf. on the Principles of Prog. Lang. (POPL), 2002.
25. CPLEX Optimizer, www.cplex.com/.
26. R. Rugina and M. C. Rinard. Symbolic bounds analysis of pointers, array indices and accessed memory regions. In ACM Conf. on Prog. Lang. Design and Impl. (PLDI), 2000.
27. A. Schrijver. Theory of Linear and Integer Programming. Wiley, N.Y., 1986.
28. M. Sharir and A. Pnueli. Two Approaches to Interprocedural Dataflow Analysis. Prentice Hall Inc., 1981.
29. D. Wagner. Static Analysis and Computer Security: New techniques for software assurance. PhD thesis, UC Berkeley, Dec 2000.
30. D. Wagner, J. S. Foster, E. A. Brewer, and A. Aiken. A first step towards automated detection of buffer overrun vulnerabilities. In Network and Distributed System Security (NDSS), 2000.
31. S. J. Wright. Primal-Dual Interior-Point Methods. SIAM Philadelphia, 1997.
32. R. Wunderling. Paralleler und Objektorientierter Simplex-Algorithmus. PhD thesis, Konrad-Zuse-Zentrum fur Informationstechnik Berlin, TR 1996-09. www.zib.de/PaperWeb/abstracts/TR-96-09/.
33. th ACM Symp. on Foundation of Soft. Engg. (ESEC/FSE), 2003.
34. S. Yong, S. Horwitz, and T. Reps. Pointer analysis for programs with structures and casting. In ACM Conf. on Prog. Lang. Design and Impl. (PLDI), 1999.