1996 · 284 citations · 24 references
ComputingComputer ScienceCompilersData StructuresParallel ComputingControl-flow AnalysisData-flow AnalysisMemory HierarchyMemory Hierarchy OptimizationShape AnalysisContext-sensitive AnalysisHeap AllocationHeap AnalysisHeap ManagementHeapsInterprocedural AnalysisPointer AnalysisShape
This paper reports on the design and implementation of a practical shape analysis for C. The purpose of the analysis is to aid in the disambiguation of heap-allocated data structures by estimating the shape (Tree, DAG, or Cyclic Graph) of the data structure accessible from each heap-directed pointer. This shape information can be used to improve dependence testing and in parallelization, and to guide the choice of more complex heap analyses.The method has been implemented as a context-sensitive interprocedural analysis in the McCAT conlpiler. Experimental results and observations are given for 16 benchmark programs. These results show that the analysis gives accurate and useful results for an important group of applications.
24
Points-to analysis in almost linear time
Bjarne Steensgaard · 1996 · 1.1K citations · Full text
Efficient context-sensitive pointer analysis for C programs
Robert P. Wilson, Monica S. Lam · ACM SIGPLAN Notices · 1995 · 538 citations
Analysis of pointers and structures
David Chase, Mark N. Wegman, F. K. Zadeck · ACM SIGPLAN Notices · 2004 · 437 citations