Putting Pointer Analysis to Work

Putting Pointer Analysis to Work (1998)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Rakesh Ghiya , Laurie J. Hendren

Citations:

91 - 8 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Putting Pointer Analysis to Work	user correction - Legacy Corrections
AUTHOR NAME	Rakesh Ghiya	user correction - Legacy Corrections
AUTHOR AFFIL	School of Computer Science, McGill University	user correction - Legacy Corrections
AUTHOR ADDR	Montr'eal, Qu'ebec, CANADA H3A 2A7	user correction - Legacy Corrections
AUTHOR NAME	Laurie J. Hendren	user correction - Legacy Corrections
AUTHOR AFFIL	School of Computer Science, McGill University	user correction - Legacy Corrections
AUTHOR ADDR	Montr'eal, Qu'ebec, CANADA H3A 2A7	user correction - Legacy Corrections
ABSTRACT	This paper addresses the problem of how to apply pointer analysis to a wide variety of compiler applications. We are not presenting a new pointer analysis. Rather, we focus on putting two existing pointer analyses, points-to analysis and connection analysis, to work. We demonstrate that the fundamental problem is that one must be able to compare the memory locations read/written via pointer indirections, at different program points, and one must also be able to summarize the effect of pointer references over regions in the program. It is straightforward to compute read/write sets for indirections involving stack-directed pointers using points-to information. However, for heap-directed pointers we show that one needs to introduce the notion of anchor handles into the connection analysis and then express read/write sets to the heap with respect to these anchor handles. Based on the read/write sets we show how to extend traditional optimizations like common subexpression elimination, loop...	user correction - Legacy Corrections
YEAR	1998	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	121--133	INFERENCE
CITATIONS	35 found	ParsCit 1.0