We propose a flow-sensitive alias analysis algorithm that computes safe and efficient alias sets in Java. For that, we pro-pose a references-set representation of aliased elements, its type table, and its propagation rules. Also, for an exception construct, we consider try/catch/finally blocks as well as potential exception statement nodes while building a control flow graph. Finally, for the safe alias computation on a control flow graph, we present a structural order traverse of each block and node.
|Cite as: Woo, J., Woo, J., Attali, I., Caromel, D., Gaudiot, J.-L. and Wendelborn, A.L. (2002). Alias Analysis for Exceptions in Java. In Proc. Twenty-Fifth Australasian Computer Science Conference (ACSC2002), Melbourne, Australia. CRPIT, 4. Oudshoorn, M. J., Ed. ACS. 321-329. |