Now showing items 1-4 of 4

    • Analyzing Memory Accesses in x86 Binary Executables 

      Balakrishnan, Gogul; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 2003)
      This paper concerns static analysis algorithms for analyzing x86 executables. The aim of the work is to recover intermediate representations that are similar to those that can be created for a program written in a high-level ...
    • Recency-Abstraction for Heap-Allocated Storage 

      Balakrishnan, Gogul; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 2005)
      In this paper, we present an abstraction for heap-allocated storage, called the recency-abstraction, that allows abstract-interpretation algorithms to recover non-trivial information for heap-allocated data objects. As an ...
    • Recovery of Variables and Heap Structure in x86 Executables 

      Balakrishnan, Gogul; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 2005)
      This paper addresses two problems that arise when analyzing executables: (1) recovering variable-like quantities in the absence of symbol-table and debugging information, and (2) recovering useful information about objects ...
    • WYSINWYX: What You See Is Not What You Execute 

      Balakrishnan, Gogul (University of Wisconsin-Madison Department of Computer Sciences, 2007)
      There is an increasing need for tools to help programmers and security analysts understand executables. For instance, commercial companies and the military increasingly use Commercial Off-The Shelf (COTS) components to ...