<p>There's a very recent survey paper available on <a href="http://researcher.watson.ibm.com/researcher/files/us-msridhar/aliasAnalysisSurvey.pdf">Alias Analysis for Object-Oriented Programs</a>.</p>

<p>It will be published in April in the LNCS state-of-the-art volume (gratuitous advertising alert): <em><a href="http://www.springer.com/computer/swe/book/978-3-642-36945-2">Aliasing in Object-Oriented Programming</a>: 
Types, Analysis and Verification.</em> Lecture Notes in Computer Science, Vol. 7850. Dave Clarke, Tobias Wrigstad, James Noble (Eds.)</p>

CC BY-SA 3.0
2013-03-06T15:39:48.053Z
This seems interesting, thank you. The approach they describe doesn't seem to be spot on for my needs, but the paper might lead me to something else.
Lii
CC BY-SA 3.0
2013-03-06T14:32:25.980Z
2013-03-06T14:32:25.980Z
Dave Clarke
<p>I am writing my master's thesis in CS and I am working with alias analysis. The thing that I am interested in is intraprocedural, flow sensitive must- and may-alias analysis for Java-like languages.</p>

<p>I am searching for texts that describe the basics of this subject in a detailed way but has been unable to locate anything really suitable.</p>

<p>I have survived a number of text books on compilers and static analysis but not found anything there.</p>

<p>I have found many papers where alias analysis is used, but most of them are focused on the problem to which alias analysis is applied and do not describe the alias analysis algorithms in detail. Others focus on C which is not suitably because of the added complexity of general pointers.</p>

<p>The best text I have found is the paper <a href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.21.4613&amp;rep=rep1&amp;type=pdf" rel="nofollow" title="Compositional Pointer and Escape Analysis for Java Programs">Compositional Pointer and Escape Analysis for Java Programs</a> by Whaley and Rinard. It is a brilliant paper and a good starting point but it doesn't discuss alias analysis specifically.</p>

<p>The problem seems so general so I expected there to be some canonical algorithms available to solve it.</p>

<p>Does anyone have any pointers to texts on this subject?</p>

<reference-request><pl.programming-languages><compilers><program-analysis>
Literature on alias analysis
Lii
# Literature on alias analysis

(Asked by: username_0 on 2013-03-06)

I am writing my master's thesis in CS and I am working with alias analysis. The thing that I am interested in is intraprocedural, flow sensitive must- and may-alias analysis for Java-like languages.

I am searching for texts that describe the basics of this subject in a detailed way but has been unable to locate anything really suitable.

I have survived a number of text books on compilers and static analysis but not found anything there.

I have found many papers where alias analysis is used, but most of them are focused on the problem to which alias analysis is applied and do not describe the alias analysis algorithms in detail. Others focus on C which is not suitably because of the added complexity of general pointers.

The best text I have found is the paper [Compositional Pointer and Escape Analysis for Java Programs](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.21.4613&rep=rep1&type=pdf "Compositional Pointer and Escape Analysis for Java Programs") by Whaley and Rinard. It is a brilliant paper and a good starting point but it doesn't discuss alias analysis specifically.

The problem seems so general so I expected there to be some canonical algorithms available to solve it.

Does anyone have any pointers to texts on this subject?

**Tags:** reference-request, pl.programming-languages, compilers, program-analysis


---

## 1 answers

### Answer by username_1 on 2013-03-06. Score: 9

There's a very recent survey paper available on [Alias Analysis for Object-Oriented Programs](http://researcher.watson.ibm.com/researcher/files/us-msridhar/aliasAnalysisSurvey.pdf).

It will be published in April in the LNCS state-of-the-art volume (gratuitous advertising alert): *[Aliasing in Object-Oriented Programming](http://www.springer.com/computer/swe/book/978-3-642-36945-2):
Types, Analysis and Verification.* Lecture Notes in Computer Science, Vol. 7850. username_1, Tobias Wrigstad, James Noble (Eds.)

> **Comments:**
> **username_0**: This seems interesting, thank you. The approach they describe doesn't seem to be spot on for my needs, but the paper might lead me to something else.  

---

