Structure aliasing in GCC

Proceedings of the GCC Developers' Summit 2005

Volumn , Issue , 2005, Pages 25-35

  Berlin, Daniel ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALIASING; DETERMINATION ALGORITHM; OPTIMIZERS; POINTS-TO ANALYSIS;

FORESTRY; OPTIMIZATION;

ALGORITHMS;

EID: 35348838004     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. L. O. Andersen. Program analysis and specialization for the C programming language. PhD thesis, University of Cophenhagen, 1994.
2. M. Das. Unification-based pointer analysis with directional assignments. ACM SIGPLAN Notices, 35(5):35-46, May 2000.
3. N. Heintze and O. Tardieu. Ultra-fast aliasing analysis using CLA: A million lines of c code in a second. In SIGPLAN Conference on Programming Language Design and Implementation, pages 254-263, 2001.
4. 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, UT, 2001.
5. E. Nuutila and E. Soisalon-Soininen. On finding the strongly connected components in a directed graph. Information Processing Letters, 49(1):9-14, Jan. 1994.
6. D. J. Pearce and P. H. J. Kelly. A dynamic algorithm for topologically sorting directed acyclic graphs. In Proceedings of the Workshop on Efficient and experimental Algorithms, Volume 3059 of Lecture Notes in Computer Science, pages 383-398. Springer-Verlag, 2004.
7. D. J. Pearce, P. H. J. Kelly, and C. Hankin. Efficient field-sensitive pointer analysis for C. In Proceedings of the ACM workshop on Program Analysis for Software Tools and Engineering. ACM Press, 2004.
8. A. Rountev and S. Chandra. Off-line variable substitution for scaling points-to analysis. ACM SIGPLAN Notices, 35(5):47-56, 2000.
9. B. Steensgaard. Points-to analysis in almost linear time. In Symposium on Principles of Programming Languages, pages 32-41, 1996.
10. R. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146-160, June 1972.