David J. Pearce, Paul H.J. Kelly and Chris Hankin Department of Computing,...  Home/Search
Context
Related
| wwwhomes.doc.ic.ac...tionSCAM2003.ps.gz 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: wwwhomes.doc.ic.ac.uk/~phjk/Pu... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper presents and evaluates a number of techniques to improve the execution time of interprocedural pointer analysis in the context of large C programs. The analysis is formulated as a graph of set constraints and solved using a worklist algorithm. Indirections lead to new constraints being added during this process. (Update)
Active bibliography (related documents): More All
1.7: Online Cycle Detection and Difference Propagation for.. - David Pearce Paul (Correct)
0.2: -621 Suggested Projects 1998 - Due Dates Project (Correct)
0.2: Fuzzy Array Data-flow Analysis Part II: Recursive Programs - Cohen, Collard (1996) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ paul-online,
author = "David Pearce Paul",
title = "Online Cycle Detection and Difference Propagation for Pointer Analysis",
url = "citeseer.ist.psu.edu/763052.html" }
Citations (may not include all citations):232 Program Analysis and Specialization for the C Programming La.. (context) - Andersen - 1994
228 Points-to analysis in almost linear time - Steensgaard - 1996 ACM DBLP
181 Principles of Program Analysis (context) - Nielson, Nielson et al. - 1999 ACM
111 Solving systems of set constraints (context) - Aiken, Wimmers - 1992
69 Unification-based pointer analysis with directional assignme.. - Das - 2000 ACM DBLP
54 Partial online cycle elimination in inclusion constraint gra.. - Fahndrich, Foster et al. - 1998 ACM DBLP
49 Incremental evaluation of computational circuits (context) - Alpern, Hoover et al. - 1990 ACM DBLP
48 Points-to analysis by type inference of programs with struct.. - Steensgaard - 1996 ACM DBLP
43 Ultra-fast aliasing analysis using CLA: A million lines of C.. - Heintze, Tardieu - 2001 DBLP
37 Introduction to set constraint-based program analysis (context) - Aiken - 1999 ACM DBLP
31 Scalable contextsensitive flow analysis using instantiation .. - Fahndrich, Rehof et al. - 2000
26 Efficient chaotic iteration strategies with widenings - Bourdoncle - 1993
19 An even faster solver for general systems of equations - Fecht, Seidl - 1996 ACM
17 An efficient general iterative algorithm for dataflow analys.. (context) - Horwitz, Demers et al. - 1987 ACM DBLP
13 Propagating differences: An efficient new fixpoint algorithm.. - Fecht, Seidl - 1998
11 Efficient evaluation of circular attribute grammars (context) - Jones - 1990
8 Maintaining a topological order under edge insertions (context) - Marchetti-Spaccamela, Nanni et al. - 1996 ACM DBLP
5 An efficient approach to computing fixpoints for complex pro.. (context) - Chen, Harrison - 1994 ACM DBLP
4 Worklist management strategies (context) - Kanamori, Weise - 1994
3 Off-line variable substitution for scaling points-to analysi.. (context) - Rouhtev, Chandra - 2000 ACM DBLP
3 Online algorithms for maintaining the topological order of a.. (context) - Pearce, Kelly - 2003
http://www.boost.org
http://suif.stanford.edu
Documents on the same site (http://wwwhomes.doc.ic.ac.uk/~phjk/Publications/): More
Locality and False Sharing in Coherent-Cache Parallel Graph.. - Bennett, Kelly (1993) (Correct)
Parallel Programming Using Skeleton Functions - Darlington, Field, Harrison.. (1993) (Correct)
Improving the Performance of Morton Layout by Array - Alignment And Loop (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