Analyzing Memory Accesses in x86 Executables

By Gogul Balakrishnan, Thomas W. Reps. International Conference on Compiler Construction, 2004

454 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Hardware and Architecture, Signal Processing

View Paper: https://www.semanticscholar.org/paper/eb5bb64db059c167b84aa0d197aaa11f0182ac70

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. David Brumley
2. Gogul Balakrishnan
3. Thanassis Avgerinos
4. Patrice Godefroid
5. David A. Molnar
6. Michael Y. Levin
7. Sang Kil Cha
8. Alexandre Rebert

In Hardware and Architecture

1. David A. Molnar
2. Patrice Godefroid
3. Michael Y. Levin
4. David Brumley
5. Thanassis Avgerinos
6. Alexandre Rebert
7. Sang Kil Cha
8. Thomas W. Reps

In Signal Processing

1. David Brumley
2. Thanassis Avgerinos
3. Michael Y. Levin
4. Sang Kil Cha
5. Patrice Godefroid
6. David A. Molnar
7. Alexandre Rebert
8. Thomas W. Reps

Citations in the corpus

• WYSINWYX: What you see is not what you eXecute (2010, methodology): “In Proceedings of the International Conference on Compiler Construction.”
• Automatic Reverse Engineering of Data Structures from Binary Execution (2010, background): “Most variables accessed during the binary’s execution can be resolved by our online algorithm.”
• Unleashing Mayhem on Binary Code (2012, methodology): “The strided interval produced by VSA is then refined by the solver (using the same binary-search strategy) to get the tight lower and upper bounds of the memory object.”
• Automated Whitebox Fuzz Testing (2008, methodology): “…the predicates i 0 6 = b , i 1 6 = a , i 2 6 = d and i 3 6 = ! according to how the conditionals evaluate, and where i 0 , i 1 , i 2 and i 3 are symbolic variables that represent the values of the memory locations of the input variables input[0], input[1], input[2] and input[3] , respectively.”