Show simple item record

dc.contributor.authorBalakrishnan, Gogulen_US
dc.contributor.authorReps, Thomasen_US
dc.date.accessioned2012-03-15T17:17:28Z
dc.date.available2012-03-15T17:17:28Z
dc.date.created2003en_US
dc.date.issued2003
dc.identifier.citationTR1486en_US
dc.identifier.urihttp://digital.library.wisc.edu/1793/60364
dc.description.abstractThis 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 language. Our goal is to perform this task for programs such as plugins, mobile code, worms, and virus-infected code. For such programs, symbol-table and debugging information is either entirely absent, or cannot be relied upon if present; hence, the technique described in the paper makes no use of symbol-table/debugging information. Instead, an analysis is carried out to recover information about the contents of memory locations and how they are manipulated. The analysis, called value-set analysis, tracks address-valued and integer-valued quantities simultaneously.en_US
dc.format.mimetypeapplication/pdfen_US
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleAnalyzing Memory Accesses in x86 Binary Executablesen_US
dc.typeTechnical Reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • CS Technical Reports
    Technical Reports Archive for the Department of Computer Sciences at the University of Wisconsin-Madison

Show simple item record