Conference Paper

Alias Analysis On Type Inference For Class Hierarchy In Java.

Dept. of Electr. Eng. Syst., Univ. of Southern California, Los Angeles, CA
DOI: 10.1109/ACSC.2001.906644 Conference: 24th Australasian Computer Science Conference (ACSC 2001), 29 January - 1 February 2001, Gold Coast, Queensland, Australia
Source: IEEE Xplore

ABSTRACT The integration of alias analysis with type information increases
the precision of alias detection, especially for inheritance among
classes. The paper presents a compile-time flow-sensitive
context-insensitive alias analysis algorithm with type information for
Java. First, we propose an aliased element representation for an object
to compute aliases efficiently. Second, the algorithm computes aliases
for shadowed variables by regarding constructors as functions. Third, it
performs type inference for each reference variable. The inferred type
information increases the precision of subsequent alias analysis by
building a complete calling graph, not only for overridden methods but
also for both shadowed variables and constructors. Fourth, it presents
algorithms to compute aliases for each statement. As a result, the
precision and efficiency of the algorithm is improved

0 Bookmarks
 · 
52 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: Proposes a flow-sensitive, context-insensitive alias analysis in Java that is more efficient and precise than previous analyses in C++. For this, we propose a reference-set alias representation and we present the propagation rules for this representation. For the type determination, the type table is built with reference variables and with all possible types of those variables. We propose an algorithm in a popular iterative loop method with a structural traversal of a context-free grammar. Finally, we show that our reference-set representation has better performance for the alias analysis algorithm than the existing object-pair representation does
    Parallel and Distributed Systems, 2001. ICPADS 2001. Proceedings. Eighth International Conference on; 01/2001
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: 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.
    Computer Science 2002, Twenty-Fifth Australasian Computer Science Conference (ACSC2002), Monash University, Melbourne, Victoria, January/February 2002; 01/2002
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Static Analysis of aliases is needed for High-Performance Computing in Java. However, existing alias analyses regardingoperator for C/C++ have difficulties in applying to Java and are even imprecise and unsafe. In this paper, we propose an alias analysis in Java that is more efficient, at least equivalent, and precise than previous analyses in C++. In the beginning, the differences between C/C++ and Java are explained and a reference-set alias representation is proposed. Second, we present flow-sensitive intraprocedural and context-insensitive interprocedural rules for the reference-set alias representation. Third, for the type determination, we build the type table with reference variables and all possible types of the reference variables. Fourth, a static alias analysis algorithm is proposed with a popular iterative loop method with a structural traverse of a CFG. Fifth, we show that our reference-set representation has better performance for the alias analysis algorithm than the existing object-pair representation. Finally, we analyze the experimental results.
    International Journal of Parallel Programming 01/2004; 32:39-76. · 0.40 Impact Factor

Full-text (3 Sources)

View
33 Downloads
Available from
May 16, 2014