Recency-Abstraction for Heap-Allocated Storage

Simple item page
dc.contributor.authorBalakrishnan, Gogulen_US
dc.contributor.authorReps, Thomasen_US
dc.date.accessioned2012-03-15T17:19:55Z
dc.date.available2012-03-15T17:19:55Z
dc.date.created2005en_US
dc.date.issued2005en_US
dc.description.abstractIn 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 application of the recency-abstraction, we show how it can resolve virtual-function calls in stripped executables (i.e., executables from which debugging information has been removed).en_US
dc.format.mimetypeapplication/pdfen_US
dc.identifier.citationTR1548en_US
dc.identifier.urihttp://digital.library.wisc.edu/1793/60478
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleRecency-Abstraction for Heap-Allocated Storageen_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR1548.pdf
Size:
1.53 MB
Format:
Adobe Portable Document Format
Download

Collections

CS Technical Reports