Alias Analysis for Exceptions in Java

We propose a flow-sensitive alias analysis algorithm that computes safe and efficient alias sets in Java. For that, we propose 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.

• Type: Conference
• Year: 2002
• Where: ACSC
• Authors: Jehak Woo, Jongwook Woo, Isabelle Attali, Denis Caromel, Jean-Luc Gaudiot, Andrew L. Wendelborn
• Keywords: ACSC 2002, Alias Analysis Algorithm, Control Flow Graph, Efficient Alias Sets, Theoretical Computer Science