A new may-alias analysis method

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.