DocumentCode
1574127
Title
A new may-alias analysis method
Author
Zhang, ZhiXiang ; Ding, Bin
Author_Institution
Computer Engineering Department, Navel Academy of Engineering, Wuhan 430033, Hubei, China
fYear
2012
Firstpage
137
Lastpage
140
Abstract
Alias analysis is important for data-flow analysis, program optimization and realization of programming environment and program analyzing tools. We have presented a novel demand-driven algorithm that answers may-alias queries. After describing the graph representation of programs and alias relation, we have formulated the alias problem as a graph traversal problem. The DFS algorithm has small time and space consumption, making the approach attractive.
Keywords
Alias analysis; Demand-driven analysis; Pointer analysis;
fLanguage
English
Publisher
ieee
Conference_Titel
World Automation Congress (WAC), 2012
Conference_Location
Puerto Vallarta, Mexico
ISSN
2154-4824
Print_ISBN
978-1-4673-4497-5
Type
conf
Filename
6321055
Link To Document