Interprocedural dependence analysis and parallelization
Michael Burke, Ron Cytron
SIGPLAN Symposium on Compiler Construction 1986
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.
Michael Burke, Ron Cytron
SIGPLAN Symposium on Compiler Construction 1986
Vugranam C. Sreedhar, Michael Burke, et al.
SIGPLAN Notices (ACM Special Interest Group on Programming Languages)
Sang Jeong Lee, Kyung Dong Ryu, et al.
ICWS 2007
Michael Burke, Ron Cytron, et al.
ACM SIGPLAN Notices