Recency-Abstraction for Heap-Allocated Storage
Gogul Balakrishnan and Thomas Reps
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 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).
(Click here to access the paper:
PostScript,
PDF.)
University of Wisconsin