M. Hind. Pointer analysis: haven't we solved this problem yet? In Proc. ACM Workshop on Program Analysis for Software Tools and Engineering, pages 54--61, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Dimensions of Precision in Reference Analysis of Object-oriented.. - Ryder (2003) (7 citations) (Correct)
....that provide sufficient precision at practical cost. 3 Dimensions of Analysis Precision There is much in common in the design of pointer analysis for C programs and some reference analyses for Java and C . Both flow sensitive and context sensitive techniques were used in pointer analysis [21]. In general, the analysis community decided that flow sensitivity was not scalable to large programs. Context sensitivity for C pointer analysis also was explored independent of flow sensitivity [17, 22, 35] but the verdict on its effectiveness is less clear. Keeping calling contexts ....
Michael Hind. Pointer analysis: Haven't we solved this problem yet? In 2001 ACM SIGPLAN - SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, pages 54-- 61, June 2001.
Precise and Efficient Call Graph Construction for C.. - Milanova, Rountev, Ryder (Correct)
....in complexity from doubly exponential to almost linear. This section describes several important dimensions of the cost precision spectrum for pointer analysis. A detailed discussion of pointer analysis, dimensions of analysis precision, and an extensive bibliography of existing work appeared in [8]. Flow sensitive vs. flow insensitive. Flow sensitive analyses take into account the flow of control between program points inside a procedure, and compute separate solutions for these points. These analyses take into account the sequence order of program statements. Flow insensitive analyses ....
M. Hind. Pointer analysis: Haven't we solved this problem yet? In Workshop on Program Analysis for Software Tools and Engineering, pages 54--61, 2001.
Pointer ANalysis and its Applications for Java Programs - Salcianu (2001) (3 citations) (Correct)
....method receives an acyclic list, it returns an acyclic list . In practice, all these analyses are closely related, and usually it is very di#cult to decide whether a specific analysis is in one category or another. Pointer analysis is a very active research area. In an invited talk at PASTE 01 [12], Michael Hind counted no fewer than seventy five papers and nine PhD theses published on pointer analysis in the last twenty one years . This abundence is explained by the fact that pointer analysis is very useful but also very di#cult. Being very useful, there is a lot of research interest on ....
Michael Hind. Pointer analysis: Haven't we solved this problem yet. In Proc. 2001.
Data Structure Analysis: An Efficient Context-Sensitive Heap.. - Lattner, Adve (Correct)
....information about all the relevant memory objects visible in each procedure, and is required to extract the internal connectivity of relevant data structure instances. In contrast, many algorithms only record alias pairs that determine the aliasing behavior of pointers within each procedure [7, 3, 12] because building an explicit heap model can be more expensive. In this paper, we develop a practical, scalable algorithm called Data Structure Analysis which provides the properties above and applies to arbitrary C programs. The key technical contributions of the Data Structure Analysis ....
....for a program to build data structure graphs that are exponential in the size of the input program. Such cases can only occur if the program builds and processes a large complex using only non loop code, and are thus extremely unlikely to occur in practice. Using a technique like k limiting [12] to guard against such unlikely cases is unattractive because it could reduce precision for reasonable data structures with paths more than k nodes long. Instead, we propose that implementations simply impose a hard limit on graph size (10,000 nodes, for example, which is much larger than any real ....
[Article contains additional citation context not shown here]
M. Hind. Pointer analysis: haven't we solved this problem yet? In ACM SIGPLAN --- SIGSOFT workshop on on Program analysis for software tools and engineering, pages 54--61. ACM Press, 2001.
Efficient Field-Sensitive Pointer Analysis for C - David Pearce Imperial (Correct)
No context found.
M. Hind. Pointer analysis: haven't we solved this problem yet? In Proc. ACM Workshop on Program Analysis for Software Tools and Engineering, pages 54--61, 2001.
Effects of Context on Program Slicing - Krinke (2006) (Correct)
No context found.
M. Hind, Pointer analysis: Haven't we solved this problem yet?, in: 2001.
Characterising, Explaining, and Exploiting the.. - Binkley, Harman, Krinke (2006) (Correct)
No context found.
M. Hind. Pointer analysis --- haven't we solved this problem yet? In Program Analysis for Software Tools and Engineering (PASTE'01). ACM, June 2001.
The Journal of Supercomputing, 28, 91--117, 2004 - Run-Time Support For (Correct)
No context found.
M. Hind. Pointer analysis: Haven't we solved this problem yet? In Proceedings of Workshop on Program Analysis For Software Tools and Engineering, pp. 54--61, 2001.
Animated Visualisation of Static Analysis.. - Binkley, Harman, Krinke (Correct)
No context found.
M. Hind. Pointer analysis --- haven't we solved this problem yet? In Program Analysis for Software Tools and Engineering (PASTE'01), Snowbird, Utah, USA, June 2001. ACM.
Analysis and Visualization of - Predicate Dependence On (Correct)
No context found.
M. Hind, "Pointer Analysis---Haven't We Solved This Problem Yet?" Program Analysis for Software Tools and Eng. (PASTE '01), June 2001.
Composition Inference for UML Class Diagrams - Milanova (2006) (Correct)
No context found.
M. Hind. Pointer analysis: Haven't we solved this problem yet? In Workshop on Program Analysis for Software Tools and Engineering, pages 54--61, 2001.
SPREE: Object Prefetching for Mobile computers - Kvilekval, Singh (2004) (Correct)
No context found.
M. Hind. Pointer analysis: Haven't we solved this problem yet? In 2001 ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE'01), Snowbird, Utah, Jun 2001. ACM.
Practical and Accurate Low-Level Pointer Analysis - Matthew (Correct)
No context found.
M. Hind, "Pointer analysis: Haven't we solved this problem yet?," in 2001.
Importance of Heap Specialization in Pointer Analysis - Nystrom, Kim, Hwu (2004) (Correct)
No context found.
Michael Hind. Pointer analysis: Haven't we solved this problem yet? In Proceedings of the 2001.
Scalable, Precise Context-Sensitive Top-Down Process for - Modular Points-To Analysis (Correct)
No context found.
Michael Hind. Pointer analysis: haven't we solved this problem yet? In Proceedings of the 2001.
Context-Sensitivity Matters, But Context Does Not - Krinke (2004) (Correct)
No context found.
M. Hind. Pointer analysis: Haven't we solved this problem yet? In 2001.
Connectivity-Based Garbage Collection - Hirzel (2004) (2 citations) (Correct)
No context found.
Michael Hind. Pointer analysis: haven't we solved this problem yet? In 2001.
Data Structure Analysis: A Fast and Scalable Context-Sensitive .. - Lattner, Adve (2003) (1 citation) (Correct)
No context found.
M. Hind. Pointer analysis: haven't we solved this problem yet? In ACM SIGPLAN --- SIGSOFT workshop on on Program analysis for software tools and engineering, pages 54--61. ACM Press, 2001.
Transparent Proxies for Java Futures - Pratikakis, Spacco, Hicks (2004) (Correct)
No context found.
Michael Hind. Pointer analysis: Haven't we solved this problem yet? In PASTE, pages 54--61, New York, June 2001.
Points-to Analysis using BDDs - Berndl, Lhoták, Qian.. (2003) (20 citations) (Correct)
No context found.
Michael Hind. Pointer Analysis: Haven't We Solved This Problem Yet? In Proceedings of PASTE'01, pages 54 -- 61, Jun 2001.
Spatial Computation - Budiu (2003) (Correct)
No context found.
Michael Hind. Pointer analysis: haven't we solved this problem yet? In ACM SIGPLANSIGSOFT Workshop on Program Analysis for Software Tools and Engineering, pages 54--61. ACM Press, 2001.
Efficient Field-Sensitive Pointer Analysis for C - Pearce, Kelly, Hankin (2004) (Correct)
No context found.
M. Hind. Pointer analysis: haven't we solved this problem yet? In Proc. ACM Workshop on Program Analysis for Software Tools and Engineering, pages 54--61, 2001.
Using Program Analysis Infrastructure for Software.. - Krinke, Streckenbach, .. (2003) (Correct)
No context found.
Michael Hind. Pointer analysis: Haven't we solved this problem yet? In 2001 ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE'01), Snowbird, UT, June 2001.
Error Checking with Client-Driven Pointer Analysis - Guyer, Lin (2003) (Correct)
No context found.
M. Hind. Pointer analysis: Haven't we solved this problem yet? In Proceedings of the 2001.
Data Structure Analysis: A Fast and Scalable Context-Sensitive .. - Lattner, Adve (2003) (1 citation) (Correct)
No context found.
M. Hind. Pointer analysis: haven't we solved this problem yet? In PASTE '01, pages 54--61. ACM Press, 2001.
LLVM: An Infrastructure for Multi-Stage Optimization - Lattner (2002) (5 citations) (Correct)
No context found.
Michael Hind. Pointer analysis: haven't we solved this problem yet? In ACM SIGPLAN --- SIGSOFT workshop on on Program analysis for software tools and engineering, pages 54--61. ACM Press, 2001.
Programmer Specified Pointer Independence - David Koes Mihai (2003) (Correct)
No context found.
Michael Hind. Pointer analysis: haven't we solved this problem yet? In Proceedings of the 2001.
Programmer Specified Pointer Independence - David Koes Mihai (2003) (Correct)
No context found.
Michael Hind. Pointer analysis: haven't we solved this problem yet? In Proceedings of the 2001.
Incorporating Domain-Specific Information into the Compilation.. - Guyer (2003) (Correct)
No context found.
Michael Hind. Pointer analysis: Haven't we solved this problem yet? In Proceedings of the 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC