Automatic discovery of API-level exploits

Proceedings - International Conference on Software Engineering

Volumn 2005, Issue , 2005, Pages 312-321

  Ganapathy, Vinod ^a   Seshia, Sanjit A ^b   Jha, Somesh ^a   Reps, Thomas W ^a   Bryant, Randal E ^b  

^a University of Wisconsin   (United States)

^b Carnegie Mellon University ^*  (United States)

Author keywords

API level exploit; Bounded model checking

Indexed keywords

APPLICATION PROGRAMMING INTERFACE (API); BOUNDED MODEL CHECKING; IBM (CO); SOFTWARE COMPONENTS;

AUTOMATION; COMPUTER SOFTWARE; CRYPTOGRAPHY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; MANAGEMENT INFORMATION SYSTEMS; SECURITY OF DATA;

INTERFACES (COMPUTER);

EID: 26944470937     PISSN: 02705257     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSE.2005.1553574     Document Type: Conference Paper

References (40)

1. nd POPL. ACM, 2005.
2. th POPL. ACM, 2002.
3. th POPL. ACM, 2002.
4. th ICSE. IEEE, 2004.
5. th TACAS, LNCS 1579. Springer, 1999.
6. M. Bond. A chosen key difference attack on control vectors. Manuscript, November 2000. http://www.cl.cam.ac.uk/~mkb23/research/CVDif.pdf.
7. C. Boyapati, S. Khurshid, and D. Marinov. Korat: Automated testing based on Java predicates. In Proc. ISSTA. ACM, 2002.
8. th CAV, LNCS 2404. Springer, 2002.
9. T. Bultan, R. Gerber, and W. Pugh. Model-checking concurrent systems with unbounded integer variables: Symbolic representations, approximations, and experimental results. ACM TOPLAS, 21(4):747-789, 1999.
10. th CCS. ACM, 2002.
11. th TACAS, 2004.
12. th Security Symp. USENIX, 2001.
13. th FSE. ACM, 2001.
14. L. de Moura, H. Rueß, and M. Sorea. Lazy theorem proving for bounded model checking over infinite domains. In Proc. CADE, LNCS 2392. Springer, 2002.
15. D. Dolev and A. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, 29(2):198-208, 1983.
16. th OSDI. ACM/USENK, 2000.
17. th National Computer Security Conference, October 1992.
18. J. S. Foster, M. Fahndrich, and A. Aiken. A theory of type qualifiers. In Proc. PLDI. ACM, 1999.
19. V. Ganapathy, S. A. Seshia, S. Jha, T. W. Reps, and R. E. Bryant. Automatic discovery of API-level vulnerabilities. Technical Report 1512, CS Dept., Univ. of Wisconsin, 2004. http://www.cs.wisc.edu/wisa/papers/tr1512/ tr1512.pdf.
20. M. Harrison, W. Ruzzo, and J. Ullmann. Protection in operating systems. Comm. ACM, 19(8), 1976.
21. th POPL. ACM, 2002.
22. G. Hoglund and G. McGraw. Exploiting Software: How to Break Code. Addison Wesley, Boston, MA, 2004.
23. D. Jackson. Automating first-order relational logic. In Proc. FSE. ACM, 2000.
24. D. B. Johnson, G. M. Dolan, M. J. Kelly, A. V. Le, and S. M. Matyas. Common cryptographic architecture cryptographic application programming interface. IBM Systems Journal, 30(2):130-150, 1991.
25. R. Joshi, G. Nelson, and K. Randall. Denali: A goal-directed superoptimizer. In Proc. PLDI. ACM, 2002.
26. nd ASPLOS. ACM, 1987.
27. S. M. Matyas, A. V. Le, and D. G. Abraham. A key management scheme based on control vectors. IBM Systems Journal, 30(2):175-191, 1991.
28. C. Meadows. The NRL Protocol Analyzer: An overview. Journal of Logic Programming, 26(2):113-131, 1996.
29. th DAC. ACM, 2001.
30. T. Newsham. Format string attacks. www.securityfocus.com/guest/3342.
31. SecurityFocus. Qualcomm qpopper vulnerability. www.securityfocus.com/ advisories/2271.
32. th LICS. IEEE, 2004.
33. th Security Symp. USENIX, 2001.
34. Siege SAT solver, http://www.cs.sfu.ca/~loryan/personal.
35. th CAV, LNCS 2404. Springer, 2002.
36. K. Sullivan, J. Yang, D. Coppit, S. Khurshid, and D. Jackson. Software assurance by bounded exhaustive testing. In Proc. ISSTA. ACM, 2004.
37. A. Thuemmel. Analysis of format string bugs. Manuscript, 2001. http://downloads.securityfocus.com/library/format-bug-analysis.pdf.
38. D. Wagner, and D. Dean Intrusion Detection via Static Analysis. In Proc. Symp. on Security and Privacy. IEEE, 2001.
39. D. Wagner, J. S. Foster, E. Brewer, and A. Aiken. A first step towards automated detection of buffer overrun vulnerabilities. In Proc. NDSS. ISOC, 2000.
40. nd POPL. ACM, 2005.