Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations
Aliasing (computing)Automatic parallelizationAutomatic vectorizationCall graph

Broader (1)

Static program analysis

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2013
Review
2013
Alias Analysis for Object-Oriented Programs
We present a high-level survey of state-of-the-art alias analyses for object-oriented programs, based on a years-long effort… 
Highly Cited
2010
Highly Cited
2010
Ad Hoc Synchronization Considered Harmful
Many synchronizations in existing multi-threaded programs are implemented in an ad hoc way. The first part of this paper does a… 
2010
2010
Shape Analysis in the Absence of Pointers and Structure
Shape analyses (Chase et al. 1990, Sagiv et al. 2002) discover properties of dynamic and/or mutable structures. We ask, “Is there… 
Review
2006
Review
2006
Precise alias analysis for static detection of web application vulnerabilities
The number and the importance of web applications have increased rapidly over the last years. At the same time, the quantity and… 
Highly Cited
2004
Highly Cited
2004
Zing: Exploiting Program Structure for Model Checking Concurrent Software
Model checking is a technique for finding bugs in systems by systematically exploring their state spaces. We wish to extract… 
2004
2004
A Methodology to Create Legal Ontologies in a Logic Programming Based Web Information Retrieval System
Web legal information retrieval systems need the capability to reason with the knowledge modeled by legal ontologies. Using this… 
Highly Cited
1999
Highly Cited
1999
Interprocedural pointer alias analysis
We present practical approximation methods for computing and representing interprocedural aliases for a program written in a… 
Highly Cited
1995
Highly Cited
1995
Interprocedural symbolic analysis
Compiling for efficient execution on advanced computer architectures requires extensive program analysis and transformation. Most… 
Highly Cited
1994
Highly Cited
1994
Interprocedural may-alias analysis for pointers: beyond k-limiting
Existing methods for alias analysis of recursive pointer data structures are based on two approximation techniques: k-limiting… 
Highly Cited
1994
Highly Cited
1994
Flow-Insensitive Interprocedural Alias Analysis in the Presence of Pointers
Data-flow analysis algorithms can be classified into two categories: flow-sensitive and flow-insensitive. To improve efficiency… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)