Understanding the connectivity of heap objects
Martin Hirzel, Johannes Henkel, et al.
ISMM 2002
We present a flow-sensitive interprocedural constant propagation algorithm, which supports recursion while only performing one flow-sensitive analysis of each procedure. We present experimental results which show that this method finds substantially more constants than previous methods and is efficient in practice. We introduce new metrics for evaluating interprocedural constant propagation algorithms which measure the number of interprocedural constant values that are propagated. We use these metrics to provide further experimental results for our algorithm. © 1995, ACM. All rights reserved.
Martin Hirzel, Johannes Henkel, et al.
ISMM 2002
Paul R. Carini, Michael Hindt
PLDI 1995
Michael Hind, Edmond Schonberg
TRI-Ada 1991
Vijay Arya, Rachel Bellamy, et al.
JMLR