Fast interprocedual alias analysis

Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89 ◽

10.1145/75277.75282 ◽

1989 ◽

Cited By ~ 39

Author(s):

K. D. Cooper ◽

K. Kennedy

Keyword(s):

Alias Analysis

Download Full-text

Efficient subcubic alias analysis for C

ACM SIGPLAN Notices ◽

10.1145/2714064.2660213 ◽

2014 ◽

Vol 49 (10) ◽

pp. 829-845 ◽

Cited By ~ 7

Author(s):

Qirun Zhang ◽

Xiao Xiao ◽

Charles Zhang ◽

Hao Yuan ◽

Zhendong Su

Keyword(s):

Alias Analysis

Download Full-text

Transformational Derivation of an Improved Alias Analysis Algorithm

Automatic Program Development ◽

10.1007/978-1-4020-6585-9_8 ◽

2008 ◽

pp. 49-70

Author(s):

Deepak Goyal

Keyword(s):

Alias Analysis ◽

Analysis Algorithm

Download Full-text

Layered Region Based Flow-Sensitive Demand-Driven Alias Analysis

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.577.917 ◽

2014 ◽

Vol 577 ◽

pp. 917-920

Author(s):

Long Pang ◽

Xiao Hong Su ◽

Pei Jun Ma ◽

Ling Ling Zhao

Keyword(s):

Program Analysis ◽

Control Flow ◽

Alias Analysis ◽

Reachability Problem ◽

Analysis Algorithm ◽

Context Free Language ◽

Context Free ◽

Free Language ◽

Demand Driven Analysis

The pointer alias is indispensable for program analysis. Comparing to point-to set, it’s more efficient to formulate the alias as the context free language (CFL) reachability problem. However, the precision is limited to flow-insensitivity. To solve this problem, we propose a flow sensitive, demand-driven analysis algorithm for answering may-alias queries. First the partial single static assignment is used to discriminate the address-taken pointers. Then the order of control flow is encoded in the level linearization code to ease comparison. Finally, the query of alias in demand driven is converted into the search of CFL reachability with feasible flows. The experiments demonstrate the effectiveness of the proposed approach.

Download Full-text