Analyzing memory accesses in x86 executables

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2985, Issue , 2004, Pages 5-23

  Balakrishnan, Gogul ^a   Reps, Thomas ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; HIGH LEVEL LANGUAGES; PROGRAM DEBUGGING; VIRUSES;

DEBUGGING INFORMATION; EXECUTABLES; INTERMEDIATE REPRESENTATIONS; MEMORY ACCESS; MEMORY LOCATIONS; MOBILE CODES; STATIC-ANALYSIS ALGORITHM; USE OF SYMBOLS;

STATIC ANALYSIS;

EID: 35048896043     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24723-4_2     Document Type: Article

References (31)

1. J. Bergeron, M. Debbabi, J. Deshamais, M.M. Erhioui, Y. Lavoie, and N. Tawbi. Static detection of malicious code in executable programs. Int. J. of Req. Eng., 2001.
2. J. Bergeron, M. Debbabi, M.M. Erhioui, and B. Ktari. Static analysis of binary code to isolate malicious behaviors. In WETICE, pages 184-189, 1999.
3. F. Bourdoncle. Efficient chaotic iteration strategies with widenings. In Int. Conf. on Formal Methods in Prog. and their Appl., Lec. Notes in Comp. Sci. Springer-Verlag, 1993.
4. C. Cifuentes and A. Fraboulet. Interprocedural data flow recovery of high-level language code from assembly. Technical Report 421, Univ. Queensland, 1997.
5. C. Cifuentes and A. Fraboulet. Intraprocedural static slicing of binary executables. In Int. Conf. on Softw. Maint., pages 188-195, 1997.
6. C. Cifuentes, D. Simon, and A. Fraboulet. Assembly to high-level language translation. In Int. Conf. on Softw. Maint., pages 228-237, 1998.
7. CodeSurfer, GrammaTech, Inc., http://www.grammatech.com/products/ codesurfer/.
8. P. Cousot and R. Cousot. Static determination of dynamic properties of programs. In Proc. 2nd Int. Symp. on Programming, pages 106-130. Dunod, Paris, France, 1976.
9. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Princ. of Prog. Lang., 1977.
10. P. Cousot and R. Cousot. Automatic discovery of linear restraints among variables of a program. In Princ. of Prog. Lang., pages 84-97, 1978.
11. S.K. Debray, R. Muth, and M. Weippert. Alias analysis of executable code. In Princ. of Prog. Lang., pages 12-24, 1998.
12. N. Dor, M. Rodeh, and M. Sagiv. CSSV: Towards a realistic tool for statically detecting all buffer overflows in C. In Prog. Lang. Design and Impl., pages 155-167, 2003.
13. Fast library identification and recognition technology, DataRescue sa/nv, Liège, Belgium, http://www.datarescue.com/idabase/flirt.htm.
14. P. Granger. Static analysis of arithmetic congruences. Int. J. of Comp. Math., 1989.
15. N. Halbwachs, Y.-E. Proy, and P. Roumanoff. Verification of real-time systems using linear relation analysis. Formal Methods in System Design, 11 (2): 157-185, 1997.
16. S. Horwitz, T. Reps, and D. Binkley. Interprocedural slicing using dependence graphs. Trans. on Prog. Lang, and Syst., 12(1):26-60, January 1990.
17. IDAPro disassembler, http://www.datarescue.corn/idabase/.
18. J.R. Larus and E. Schnarr. EEL: Machine-independent executable editing. In Prog. Lang. Design and Impl., pages 291-300, 1995.
19. M. Müller-Olm and H. Seidl. Precise interprocedural analysis through linear algebra. In Princ. of Prog. Lang., 2004.
20. A. Mycroft. Type-based decompilation. In European Symp. on Programming, 1999.
21. E.W. Myers. Efficient applicative data types. In Princ. of Prog. Lang., pages 66-75, 1984.
22. A. Pioli and M. Hind. Combining interprocedural pointer analysis and conditional constant propagation. Tech. Rep. RC 21532(96749), IBM T.J. Watson Research Center, March 1999.
23. W. Pugh. The Omega test: A fast and practical integer programming algorithm for dependence analysis. In Supercomputing, pages 4-13, 1991.
24. G. Ramalingam, J. Field, and F. Tip. Aggregate structure identification and its application to program analysis. In Princ. of Prog. Lang., pages 119-132, 1999.
25. T. Reps and G. Rosay. Precise interprocedural chopping. In Found, of Softw. Eng., 1995.
26. T. Reps, T. Teitelbaum, and A. Demers. Incremental context-dependent analysis for languagebased editors. Trans, on Prog. Lang, and Syst., 5(3):449-477, July 1983.
27. X. Rival. Abstract interpretation based certification of assembly code. In Int. Conf. on Verif., Model Checking, and Abs. Int., 2003.
28. R. Rugina and M.C. Rinard. Symbolic bounds analysis of pointers, array indices, and accessed memory regions. New York, NY. ACM Press.
29. M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In S.S. Muchnick and N.D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 7, pages 189-234. Prentice-Hall, Englcwood Cliffs, NJ, 1981.
30. N. Suzuki and K. Ishihata. Implementation of an array bound checker. In Princ. of Prog. Lang., pages 132-143, 1977.
31. Z. Xu, B. Miller, and T. Reps. Safety checking of machine code. In Prog. Lang. Design and Impl., pages 70-82, 2000.