#### DMCA

## Unification-based Pointer Analysis with Directional Assignments (2000)

### Cached

### Download Links

Citations: | 214 - 7 self |

### Citations

664 |
Data Structures and Network Algorithms
- Tarjan
- 1983
(Show Context)
Citation Context ...unded by the number of distinct nodes. The amortized cost of N lookup operations and M unication operations using a fastunion -nd structure is O(N(M;N)) where is the inverse Ackermann's function [Tar=-=83]-=-. Therefore, the initial phase of the algorithm has almost linear running time. Thesow step involves reachability over the linear graph structure, for every symbol associated with a node in the 5 (b) ... |

654 | Parametric shape analysis via 3-valued logic - Sagiv, Reps, et al. |

619 | Program Analysis and Specialization for the C Programming Language
- Andersen
- 1994
(Show Context)
Citation Context ... approach [Ste96b] (almost linear running-time), which scale well to large programs but produce relatively imprecise results. On the other hand, algorithms such as Andersen's subtyping-based approach =-=[And94]-=- (worst-case cubic running-time) produce much more precise results, but do not scale well to large programs. The challenge has been to design an analysis that has the scaling properties of Steensgaard... |

589 | Points-to analysis in almost linear time
- Steensgaard
- 1996
(Show Context)
Citation Context ...ulness of subsequent analyses [SH97a]. The focus of this paper issow and context insensitive pointer analysis. Within this domain, there are algorithms such as Steensgaard's unication-based approach [=-=Ste96b]-=- (almost linear running-time), which scale well to large programs but produce relatively imprecise results. On the other hand, algorithms such as Andersen's subtyping-based approach [And94] (worst-cas... |

431 | Efficient context-sensitive pointer analysis for C programs - Wilson, Lam - 1995 |

412 | Context-sensitive interprocedural points-to analysis in the presence of function pointers - Emami, Ghiya, et al. - 1994 |

348 | A safe approximate algorithm for interprocedural pointer aliasing - Landi, Ryder - 1992 |

211 | Is it a tree, a DAG, or a cyclic graph? A shape analysis for heapdirected pointers in C - Ghiya, Hendren - 1996 |

127 | Partial online cycle elimination in inclusion constraint graphs
- Faehndrich, Foster, et al.
- 1998
(Show Context)
Citation Context ... 0 ^ 0 A ` x : ('; ; ) A ` y : (' 0 ; 0 ; 0 ) 0 A ` welltyped(x = y) Figure 5: Assignment processing in Andersen's algorithm. The domains and type rule in (a) above, taken from [FFSA98], provide a declarative specication of assignment handling. The graph in (b) above represents the eect of the assignment action, which is to induce subtyping relationships between the pointed-to loc... |

97 | Efficient type inference for higher-order binding-time analysis
- Henglein
- 1991
(Show Context)
Citation Context ...restricted to one level in the type structure. This idea has been previously used in other contexts. It is called \simple closure analysis" in [Hen92] and is the basis of ecient binding-time anal=-=ysis [Hen91], closure -=-analysis and dynamic type inference algorithms. In a subtype setting, the restriction to top level is characterized by the absence of \induced" or \deep" subtyping rules. Our work shows that... |

89 | Efficient points-to analysis for whole-program analysis
- Liang, Harrold
- 1999
(Show Context)
Citation Context ...tion graph that recordssow information. This approach has been found to scale to large programs in practice. Liang and Harrold have developed a second approach that operates on an explicit call graph =-=[LH99]-=-. However, they have only tested this approach on very small programs without indirect calls. We have found that in larger programs, which contain many indirect calls and large points-to sets for func... |

75 | The effects of the precision of pointer analysis
- Shapiro, Horwitz
(Show Context)
Citation Context ...a fee. PLDI 2000, Vancouver, British Columbia, Canada. Copyright 2000 ACM 1-58113-199-2/00/0006...$5.00. points-to information can greatly impact the performance and usefulness of subsequent analyses =-=[SH97a-=-]. The focus of this paper issow and context insensitive pointer analysis. Within this domain, there are algorithms such as Steensgaard's unication-based approach [Ste96b] (almost linear running-time)... |

72 | Pointer analysis for programs with structures and casting - Yong, Horwitz, et al. - 1999 |

70 | Points-to analysis by type inference of programs with structures and unions - Steensgaard - 1996 |

47 | Effective whole-program analysis in the presence of pointers
- Atkinson, Griswold
(Show Context)
Citation Context ...ch contain many indirect calls and large points-to sets for function pointers, call graphs become unmanageably large. We have found this to be true even after using thesltering techniques proposed in =-=[AG98]-=-. Therefore, we believe that polymorphic type inference is the best option for scalable context-sensitive pointer analysis. The drawback of a context-sensitive extension of Steensgaard 's analysis is ... |

45 | Projection merging: Reducing redundancies in inclusion constraint graphs
- Su, Fähndrich, et al.
- 2000
(Show Context)
Citation Context ..., namely on improving the scaling behaviour of Andersen 's algorithm. The implementation of Andersen's analysis developed at UC Berkeley uses on-line cycle elimination [FFSA98] and projection merging =-=[SFA00-=-] to speed up the analysis substantially. Rountev and Chandra have used a pre-processing step to further improve performance by a factor of two [RC00]. In spite of these eorts, Andersen's algorithm do... |

18 | EÆcient interprocedural computation of pointerinduced aliases and side-eects - Choi, Burke, et al. - 1993 |

16 | O-line variable substitution for scaling points-to analysis
- Rountev, Chandra
- 2000
(Show Context)
Citation Context ...cycle elimination [FFSA98] and projection merging [SFA00] to speed up the analysis substantially. Rountev and Chandra have used a pre-processing step to further improve performance by a factor of two =-=[RC0-=-0]. In spite of these eorts, Andersen's algorithm does not yet scale to programs beyond 500KLOC. We believe that our use of a highly ecient unication engine at all but the critical regions of the poin... |

12 |
Fast and accurate points-to analysis
- Shapiro, Horwitz
- 1997
(Show Context)
Citation Context ...alysis itself. Shapiro and Horwitz viewed the dierence in terms of thesnal points-to graph. Therefore, they designed an algorithm that allows k-limited outdegree at all levels of the points-to graph [=-=SH97b-=-]. We believe the interesting dierence is really in the analysis itself. Therefore, our algorithm allows some amount of directionality (using subtyping) at assignments. In terms of thesnal points-to g... |

6 |
Simple closure analysis. DIKU Semantics Report D-193
- Henglein
- 1992
(Show Context)
Citation Context ...t resulted from this exercise is an example of subtyping restricted to one level in the type structure. This idea has been previously used in other contexts. It is called \simple closure analysis"=-=; in [Hen92]-=- and is the basis of ecient binding-time analysis [Hen91], closure analysis and dynamic type inference algorithms. In a subtype setting, the restriction to top level is characterized by the absence of... |

5 |
From polymorphic subtyping to CFL reachability: Context-sensitive flow analysis using instantiation constraints
- Fähndrich, Rehof, et al.
- 2000
(Show Context)
Citation Context ...he one levelsow algorithm. A natural question that arises is whether the two techniques can be combined for maximum benet. One solution is to use the technique of polymorphicsow analysis proposed in [=-=FRD99]-=-. Much work has also been done from the other direction, namely on improving the scaling behaviour of Andersen 's algorithm. The implementation of Andersen's analysis developed at UC Berkeley uses on-... |

5 | From Polymorphic Subtyping to CFL Reachability: Context-Sensitive Flow Analysis Using Instantiation Constraints
- Fähndrich, Rehof, et al.
- 2000
(Show Context)
Citation Context ...he one levelsow algorithm. A natural question that arises is whether the two techniques can be combined for maximum benet. One solution is to use the technique of polymorphicsow analysis proposed in =-=[FRD99]-=-. Much work has also been done from the other direction, namely on improving the scaling behaviour of Andersen's algorithm. The implementation of Andersen's analysis developed at UC Berkeley uses on-l... |

4 |
Scalable context-sensitive analysis using instantiation constraints
- Fahndrich, Rehof, et al.
- 2000
(Show Context)
Citation Context ...al testing, we veried the correctness of our implementation in three ways: First, we compared our implementation against an independent implementation of Steensgaard's analysis produced by our group [=-=FRD00]-=-, and against an implementation of Steensgaard's analysis produced using the BANE framework at UC Berkeley [FFSA98]. All three implementations produce identical points-to information for all of the SP... |

4 | Aggregate structure identi and its application to program analysis - Ramalingam, Field, et al. - 1999 |

1 |
Toolkit documentation. //research.microsoft.com/sbt/asttoolkit/ast.htm
- AST
(Show Context)
Citation Context ...gorithm, and our experimental setup. We then present our results. 4.1 Implementation and experimental setup We have produced a modular implementation of Steensgaard 's algorithm using the AST Toolkit =-=[AST]-=-, which is itself an extension of the Microsoft Visual C compiler. Our implementation, which includes a client and a linker, handles all of the features of C. The client analyzes individual compilatio... |