Slicing class hierarchies in C++
Frank Tip, Jong-Deok Choi, et al.
OOPSLA 1996
Data-flow analysis is a basis for program optimization and parallelizing transformations. The mechanism of passing reference parameters at call sites generates interprocedural aliases which complicate this analysis. Solutions have been developed for efficiently computing interprocedural aliases. However, factoring the computed aliases into data-flow information has been mostly overlooked, although improper factoring results in imprecise 1992 data-flow information. In this document, we describe a mechanism which, in factoring in interprocedural aliases, computes data-flow information more precisely and with less time and space overhead than previous approaches. © 1992, ACM. All rights reserved.
Frank Tip, Jong-Deok Choi, et al.
OOPSLA 1996
Michael Hind, Michael Burke, et al.
Scientific Programming
Frances Allen, Michael Burke, et al.
Journal of Parallel and Distributed Computing
Christoph Von Praun, Harold W. Cain, et al.
ISCA 2006