Putting pointer analysis to work

Abstract

This manuscript has been reproduced from the microfilm master. UMI films the text directly from the original or copy submitted. Thus, some thesis and dissertation copies are in typewriter face, while others may be from any type of computer printer.The quality of this reproduction is dependent upon the quality of the copy submitted. Broken or indistinct print, colored or poor quality illustrations and photographs, print bleedthrough, substandard margins, and improper alignment can adversely affect reproduction.In the unlikely event that the author did not send UMI a complete manuscript and there are missing pages, these will be noted. Also, if unauthorized copyright material had to be removed, a note will indicate the deletion.Oversize materials (e.g., maps, drawings, charts) are reproduced by sectioning the original, beginning at the upper left-hand corner and continuing from Left to right in equal sections with small overlaps.Photographs included in Uie original manuscript have been reproduced xerographically in this copy. Higher quality 8" x 9" black and white photographic prints are available for any photographs or illustrations appearing in this copy for an additional charge. Contact UMI directly to order. The author retains ownership of the L'auteur conserve la propriete du copyright in this thesis. Neither the droit d'auteur qui protege cette these. thesis nor substantial extracts fiom it Ni la these ni des extraits substantiels may be printed or otherwise de celle-ci ne doivent Etre imprimes reproduced without the author's ou autrement reproduits sans son permission.autorisation. AbstractPointer analysis has recently been a subject of active research. The focus of most techniques is on: (1) estimating the targets for stack-directed pointers, (2) computing relationships between heap-directed pointers, or (3) developing faster or more space-efficient algorithms. However, little at tention has been paid to actually using the results of pointer analysis for compiler optimizations. This thesis addresses the problem of how to apply pointer analysis information to a wide variety of compiler applications. That is, once the pointer relationships are computed, what can we do with this information? How do we put pointer analysis to work?We have used the pointer andyses implemented in the framework of the McCAT C compiler as the basis of our study. These analyses include, points-to analysis for stackdirected pointers, and connection and shape analyses for heap-directed pointers. We demonstrate that the fundamental problem is that one must be able to compare the memory locations readlwritten via pointer indirections, at different programs points, and one must also be able to summarize the effect of pointer references over regions in the program. It is straightforward to compute readlwrite sets for indirections involving stack-directed pointers using points-to information. However, for heapdirected pointers we show that one needs to introduce the notion of anchor handles into the connection analysis and then compute re...

A Compile/Run-time Environment for the Automatic Transformation of Linked List Data Structures

“…In order to prove safety of the transformations, pointer analysis techniques must be used. The work of Ghiya [10] shows an extensive overview of pointer analysis techniques in the context of recursive data structures.…”

“…For instance, if throughout the execution of the loop the variable idx_ex pr defines the sequence (5, 50, 10), then only the elements A [5], A [50] and A [10] need to be defined.…”

Component Composition for Embedded Systems Using Semantic Aspect-Oriented Programming

“…Interprocedural context-sensitive pointer analyses [204,107,57] typically compute points-to relationships by caching generated contexts and using fixpoint computation inside strongly connected components of the call graph. Because our analysis tracks more detailed information about the heap, we have chosen to make it compositional at the level of procedures.…”

On the design of global object space for efficient multi-threading Java computing on clusters

“…Jackal's compiler performs two optimizations: object-graph aggregation and automatic computation migration, whose aims are similar to those of our object pushing and synchronized method migration. Objectgraph aggregation uses a heap approximation algorithm [15] to identify those related objects. However, the heap approximation algorithm cannot distinguish between different objects that are created at the same allocation site.…”