论文信息 - Fast Points-to Analysis for Languages with Structured Types

Fast Points-to Analysis for Languages with Structured Types

The C programming language is still ubiquitous in embedded software development. For many tools that operate on programs written in pointer languages like C, it is essential to have a good approximation of the information about where the pointer variables possibly may point to at runtime. We present a points-to analysis, which is based on Steensgaard’s approach to points-to analysis [12], but achieves a higher level of precision.

Sorin A. Huss | Michael Jung

[1] Donglin Liang,et al. Efficient points-to analysis for whole-program analysis , 1999, ESEC/FSE-7.

[2] Michael Hind,et al. Which pointer analysis should I use? , 2000, ISSTA '00.

[3] Todd M. Austin,et al. Efficient detection of all pointer and array access errors , 1994, PLDI '94.

[4] Peter Sestoft,et al. Partial evaluation and automatic program generation , 1993, Prentice Hall international series in computer science.

[5] G. Ramalingam,et al. The undecidability of aliasing , 1994, TOPL.

[6] Robert E. Tarjan,et al. Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.

[7] Manuvir Das,et al. Unification-based pointer analysis with directional assignments , 2000, PLDI '00.

[8] Michael Hind,et al. Pointer analysis: haven't we solved this problem yet? , 2001, PASTE '01.

[9] Mark N. Wegman,et al. Analysis of pointers and structures , 1990, SIGP.

[10] Bjarne Steensgaard,et al. Points-to analysis in almost linear time , 1996, POPL '96.

[11] M. Petró‐Turza,et al. The International Organization for Standardization. , 2003 .

[12] Bjarne Steensgaard. Points-to Analysis by Type Inference of Programs with Structures and Unions , 1996, CC.