Alias analysis

Alias analysis is a technique in compiler theory, used to determine if a storage location may be accessed in more than one way. Two pointers are said… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
This paper presents a demand-driven, flow-insensitive analysisalgorithm for answering may-alias queries. We formulate… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
This paper presents the first scalable context-sensitive, inclusion-based pointer alias analysis for Java programs. Our approach… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We present practical approximation methods for computing and representing interprocedural aliases for a program written in a… (More)
  • figure 1
  • figure 4
  • figure 6
  • figure 8
  • figure 10
Is this relevant?
Highly Cited
1998
Highly Cited
1998
This paper evaluates three alias analyses based on programming language types. The first analysis uses type compatibility to… (More)
  • table 1
  • table 2
  • figure 4
  • table 3
  • figure 3
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Recent years have seen increasing interest in systems that reason about and manipulate executable code. Such systems can… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Determining aliases is one of the foundamental static analysis problems, in part because the precision with which this problem is… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Recent work on alias analysis in the presence of pointers has concentrated on context-sensitive interprocedural analyses, which… (More)
  • figure 1
  • figure 3
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Existing methods for alias analysis of recursive pointer data structures are based on two approximation techniques: k-limiting… (More)
  • figure 1
  • figure 8
  • figure 13
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Data-ow analysis algorithms can be classiied into two categories: ow-sensitive and ow-insensitive. To improve eeciency, ow… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
We present a new algorithm for computing interprocedural aliases due to passing parameters by reference. This algorithm runs in O… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?