Javascript must be enabled to continue!
Alias analysis method for object‐oriented programs using alias flow graphs
View through CrossRef
AbstractWhen a pair of expressions (or partial expressions) on a program text point to the same object (memory area), these expressions are said to be in an alias relation. These occur by indirect references etc. via a parameter passing with delivery, reference variable, pointer, etc. The existing alias analysis methods are insufficient in terms of reusability of analysis results, not allowing the reusability of object‐oriented programs in the alias analyses. Furthermore, although various proposals of alias analysis methods have been published in the past, practical tools have not yet been available. This study proposes an alias analysis method for object‐oriented programs that considers moduling and reutilization of alias analysis results. The Java alias analysis tool that realizes the proposed method can analyze a large‐scale program such as a class library attached to the JDK (Java Developer's Kit) in a practical time. © 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(4): 49–59, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.1231
Title: Alias analysis method for object‐oriented programs using alias flow graphs
Description:
AbstractWhen a pair of expressions (or partial expressions) on a program text point to the same object (memory area), these expressions are said to be in an alias relation.
These occur by indirect references etc.
via a parameter passing with delivery, reference variable, pointer, etc.
The existing alias analysis methods are insufficient in terms of reusability of analysis results, not allowing the reusability of object‐oriented programs in the alias analyses.
Furthermore, although various proposals of alias analysis methods have been published in the past, practical tools have not yet been available.
This study proposes an alias analysis method for object‐oriented programs that considers moduling and reutilization of alias analysis results.
The Java alias analysis tool that realizes the proposed method can analyze a large‐scale program such as a class library attached to the JDK (Java Developer's Kit) in a practical time.
© 2004 Wiley Periodicals, Inc.
Syst Comp Jpn, 35(4): 49–59, 2004; Published online in Wiley InterScience (www.
interscience.
wiley.
com).
DOI 10.
1002/scj.
1231.
Related Results
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Abstract
Chordal graphs are characterized as the intersection graphs of subtrees in a tree and such a representation is known as the tree model. Restricting the characteriz...
Object‐Oriented Analysis
Object‐Oriented Analysis
AbstractObject‐oriented analysis is a method of formulating a model of a desired software system in terms of objects and their interactions. The discipline was started by practitio...
On the reciprocal distance spectrum of edge corona of graphs
On the reciprocal distance spectrum of edge corona of graphs
The reciprocal distance spectrum (Harary spectrum) of a connected graph [Formula: see text] is the multiset of eigenvalues of its reciprocal distance matrix (Harary matrix) [Formul...
Pressure Analysis of DST Flow Period Or Slug Flow For Horizontal Wells In Homogeneous Reservoir
Pressure Analysis of DST Flow Period Or Slug Flow For Horizontal Wells In Homogeneous Reservoir
Abstract
By the transient pressure for horizontal well with constant flow rate and Duhamel's principle, this paper presents the method to calculate the transient ...
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
The area of Data Analytics on graphs promises a paradigm shift, as we approach information processing of new classes of data which are typically acquired on irregular but structure...
Computing the Energy of Certain Graphs based on Vertex Status
Computing the Energy of Certain Graphs based on Vertex Status
Background:
The concept of Hückel molecular orbital theory is used to compute the graph energy numerically and graphically on the base of the status of a vertex.
Objective:
Our a...

