String analysis for x86 binaries

ACM SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering

Volumn , Issue , 2005, Pages 88-95

  Christodorescu, Mihai ^a   Kidd, Nicholas ^a   Goh, Wen Han ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXECUTABLE PROGRAMS; EXECUTABLES; KEYPOINTS; PROGRAM POINTS; PROGRAM UNDERSTANDING; SOURCE CODES; STRING ANALYSIS;

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; REVERSE ENGINEERING;

PROGRAM DEBUGGING;

EID: 84866655092     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1108792.1108814     Document Type: Conference Paper

References (22)

1. R. Z. Altucher and W. Landi. An extended form of must alias analysis for dynamic allocation. In POPL '95: Proceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 74-84, New York, NY, USA, 1995. ACM Press.
2. G. Balakrishnan and T. Reps. Analyzing memory accesses in x86 executables. In Proceedings of the International Conference on Compiler Construction (CC'04), pages 5-23, 2004.
3. A. S. Christensen, A. Møller, and M. I. Schwartzbach. Extending Java for high-level Web service construction. ACM Transactions on Programming Languages and Systems, 25(6):814-875, Nov. 2003. (Pubitemid 41283893)
4. A. S. Christensen, A. Møller, and M. I. Schwartzbach. Precise analysis of string expressions. In Proceedings of the 10th International Static Analysis Symposium (SAS '03), volume 2694 of Lecture Notes in Computer Science, pages 1-18. Springer-Verlag, June 2003.
5. C. Cifuentes and A. Fraboulet. Interprocedural dataflow recovery of high-level language code from assembly. Technical report, University of Queensland, 1997.
6. C. Cifuentes, D. Simon, and A. Fraboulet. Assembly to high-level language translation. In Proceedings of the International Conference on Software Maintenance, pages 228-237, 1998.
7. DataRescue sa/nv. IDA Pro - interactive disassembler. Published online at http://www.datarescue.com/idabase/. Last accessed on 3 Feb. 2003.
8. S. K. Debray, R. Muth, and M. Weippert. Alias analysis of executable code. In Proceedings of the 1998 Conference on Principles of Programming Languages (POPL'98), pages 12-24, 1998.
9. N. Dor, M. Rodeh, and M. Sagiv. CSSV: Towards a realistic tool for statically detecting all buffer overflows in C. In Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation (SIGPLAN'03), pages 155-167, San Diego, CA, USA, June 2003. ACM Press.
10. V. Ganapathy, S. Jha, D. Chandler, D. Melski, and D. Vitek. Buffer overrun detection using linear programming and static analysis. In Proceedings of the 10th ACM Conference on Computer and Communications Security (CCS'03), pages 345-354, Washington D.C., USA, Oct. 2003. ACM Press.
11. C. Gould, Z. Su, and P. Devanbu. JDBC checker: A static analysis tool for SQL/JDBC applications. Formal research demo presented at the 26th International Conference on Software Engineering (ICSE '04), May 2004.
12. C. Gould, Z. Su, and P. Devanbu. Static checking of dynamically generated queries in database applications. In Proceedings of the 26th International Conference on Software Engineering (ICSE '04), pages 645-654, Edinburgh, Scotland, UK, May 2004. IEEE Computer Society.
13. C. Kirkegaard, A. Møller, and M. I. Schwartzbach. Static analysis of XML transformations in Java. IEEE Transactions on Software Engineering, 30(3):181-192, Mar. 2004.
14. A. Lakhotia and E. U. Kumar. Abstract stack graph to detect obfuscated calls in binaries. In Proceedings of the Fourth IEEE International Workshop on Source Code Analysis and Manipulation, pages 17-26, Chicago, IL, USA, Sept. 2004. IEEE Computer Society.
15. D. Larochelle and D. Evans. Statically detecting likely buffer overflow vulnerabilities. In Proceedings of the 2001 USENIX Security Symposium, 2001.
16. M. Mohri and M.-J. Nederhof. Regular approximation of context-free grammars through transformation. In J.-C. Junqua and G. van Noord, editors, Robustness in Language and Speech Technology, pages 153-163. Kluwer Academic Publishers, 2001.
17. A. Mycroft. Type-based decompilation. In Proceedings of the European Symposium on Programming, volume 1576 of Lecture Notes in Computer Science, pages 208-223. Springer-Verlag, 1999.
18. T. Reps, S. Schwoon, S. Jha, and D. Melski. Weighted pushdown systems and their application to interprocedural dataflow analysis. Science of Computer Programming, 2005. to appear.
19. R. Rugina and M. C. Rinard. Symbolic bounds analysis of pointers, array indices, and accessed memory regions. In Proceedings of the ACM SIGPLAN 2000 Conference on Programming Language Design and Implementation (PLDI'00), pages 182-195, Vancouver, BC, Canada, June 2000. ACM Press.
20. R. Vall, E. Phong, C. Etienne, G. Laurie, H. Patrick, and L. Vijay. Soot - a Java bytecode optimization framework, 1999.
21. D. Wagner, J. S. Foster, E. A. Brewer, and A. Aiken. A first step towards automated detection of buffer overrun vulnerabilities. In Proceedings of the Networking and Distributed System Security Symposium (NDSS'00), San Diego, California, Feb. 2000.
22. Y. Xie, A. Chou, and D. Engler. Archer: Using symbolic, path-sensitive analysis to detect memory access errors. ACM SIGSOFT Software Engineering Notes, 28(5):327-336, Sept. 2003.