Bjarne Steensgaard  Home/Search
Context Related
| colorado.edu/~diwan/553599...steens.ps acaps.cs.mcgill.ca...pointsto_popl96.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: colorado.edu/~diwan/5535...index (more) (Enter author homepages) |
Rate this article:      (best)View Comments (0) |
Abstract: We present an interprocedural flow-insensitive points-to analysis based on type inference methods with an almost linear time cost complexity. To our knowledge, this is the asymptotically fastest non-trivial interprocedural points-to analysis algorithm yet described. The algorithm is based on a non-standard type system. The type inferred for any variable represents a set of locations and includes a type which in turn represents a set of locations possibly pointed to by the variable. The type... (Update)
Cited by: More
Efficient Field-Sensitive Pointer Analysis for C - David Pearce Imperial (Correct)
Recovery of Variables and Heap Structure in x86 Executables - Gogul Balakrishnan Bgogul (Correct)
Recency-Abstraction for Heap-Allocated Storage Gogul.. - Comp Sci Dept (Correct)
Similar documents (at the sentence level):
9.5%: Points-to Analysis by Type Inference of Programs with.. - Steensgaard (1996) (Correct)
8.8%: Points-to Analysis in Almost Linear Time - Steensgaard (1996) (Correct)
Active bibliography (related documents): More All
0.1: Program Decomposition for Pointer-induced Aliasing Analysis - Zhang, Ryder, Landi (1996) (Correct)
0.1: Evaluating The Effectiveness of Pointer Alias Analyses - Hind, Pioli (1999) (Correct)
0.1: Optimizing Sparse Representations for Dataflow Analysis - Ruf (1995) (Correct)
Similar documents based on text: More All
0.2: Extending and Evaluating Flow-insensitive and.. - Liang, Pennings, Harrold (2001) (Correct)
0.1: Off-line Variable Substitution for Scaling Points-to Analysis - Rountev, Chandra (2000) (Correct)
0.1: Points-To for Java: A General Framework and an Empirical.. - Streckenbach, Snelting (2000) (Correct)
Related documents from co-citation: More All
47: Context-sensitive interprocedural points-to analysis in the presence of function.. - Emami, Ghiya et al. - 1994
46: Efficient context-sensitive pointer analysis for C programs - Wilson, Lam - 1995
43: Fast and accurate flow-insensitive point-to analysis - Shapiro, Horwitz - 1997
BibTeX entry: (Update)
B. Steensgaard. Points-to analysis in almost linear time. In Conference Record of the 23th Annual ACM Symposium on Principles of Programming Languages (POPL'96), pages 32--41. ACM Press, January 1996. http://citeseer.ist.psu.edu/article/steensgaard95pointsto.html More
@inproceedings{ steensgaard96pointsto,
author = "Bjarne Steensgaard",
title = "Points-to Analysis in Almost Linear Time",
booktitle = "Symposium on Principles of Programming Languages",
pages = "32-41",
year = "1996",
url = "citeseer.ist.psu.edu/article/steensgaard95pointsto.html" }
Citations (may not include all citations):1399 Compilers---Principles (context) - Aho, Sethi et al. - 1986
254 Revised 4 report on the algorithmic language Scheme - Clinger, Rees - 1991
252 Analysis of pointers and structures (context) - Chase, Wegman et al. - 1990
246 Context-sensitive interprocedural points-to analysis in the .. - Emami, Ghiya et al. - 1994
227 Kernighan and Dennis M (context) - Brian - 1988
180 Efficient contextsensitive pointer analysis for C programs - Wilson, Lam - 1995
175 A safe approximate algorithm for interprocedural pointer ali.. - Landi, Ryder - 1992
101 Context-insensitive alias analysis reconsidered - Ruf - 1995
88 Implementation of the typed call-by-value -calculus using a .. (context) - Tofte, Talpin - 1994
70 Points-to analysis in almost linear time - Steensgaard - 1995
69 Interprocedural modification side effect analysis with point.. - Landi, Ryder et al. - 1993
68 Interprocedural data flow analysis in the presence of pointe.. - Weihl - 1980
64 Efficient type inference for higher-order binding-time analy.. - Henglein - 1991
63 A storeless model of aliasing and its abstractions using fin.. (context) - Deutsch - 1992
62 Program Analysis and Specialization for the C Programming La.. (context) - Andersen - 1994
51 Value dependence graphs: Representation without taxation - Weise, Crew et al. - 1994
45 Efficient detection of all pointer and array access errors - Austin, Breach et al. - 1994
36 Interprocedural may-alias analysis for pointers: Beyond k-li.. (context) - Deutsch - 1994
36 Efficient flow-sensitive interprocedural computation of poin.. (context) - Choi, Burke et al. - 1993
19 Sparse functional stores for imperative programs - Steensgaard - 1995
17 Data structures and network flow algorithms (context) - Tarjan - 1983
2 Almost linear time points-to analyses (context) - Landi - 1995
2 Use algorithm from [Stea] program restructuring tool (context) - Griswold, algorithm et al. - 1995
2 Poster presentation at PLDI (context) - Morgenthaler - 1995
2 Poster presentation at PLDI (context) - Zhang - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.colorado.edu/~diwan/5535-99/index.html): More
Compiled by Bay-Wei Chang The - Group Cis (Correct)
Garbage Collection and Local Variable Type-Precision and.. - Agesen, Detlefs, Moss (1998) (Correct)
Orthogonally Persistent Object Systems - Atkinson, Morrison (1995) (Correct)
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