University of Houston
Department of Computer Science
In partial fulfillment of the Requirements for the Degree of
Master of Science
Yi Wen
will defend his thesis
A PRECISE CALLGRAPH ALGORITHM
AND ITS IMPLEMENTATION IN OPEN64 COMPILER AND DRAGON TOOL
Abstract
We present a practical algorithm for constructing precise program call graph. Our
algorithm supports recursive calls and dynamic bound calls arise from invocations of
procedure-valued formal parameters that only receive their values via parameter passing.
The call graphs constructed by this algorithm can be used to recover precise call
chains so that more aggressive interprocedural analyses and optimizations can be done
based on them. We prove the correctness of the algorithm and discuss the algorithm
in relationship to other approaches. We implemented this algorithm in Open64 compiler
to replace its own call graph construction codes which cannot handle recursive
programs and programs containing formal procedure parameters. The result graphs
are shown in our dragon tool, a graphic interface to help programmers understanding
their parallel application programs. The graphs can be used to improve interprocedural
analyses and optimizations components of Open64 compiler.
Date: Thursday, March 11, 2004
Time: 1:00 PM
Place: 550-PGH
Faculty, students, and the general public are invited.
Thesis Advisor: Dr. Chapman