| | |
Summary: Design and Evaluation of a Demand Driven Technique for Call
Graph Construction
Gagan Agrawal y Jinqian Li Qi Su
y Department of Computer and Information Sciences
Ohio State University, Columbus, OH 43210
agrawal@cis.ohio-state.edu
Department of Computer and Information Sciences
University of Delaware, Newark DE 19716
fli,sug@eecis.udel.edu
Abstract
With the increasing importance of just-in-time or dynamic compilation and the use of program
analysis as part of software development environments, there is a need for techniques for demand
driven construction of a call graph. We have developed a technique for demand driven call graph
construction which handles dynamic calls due to polymorphism in object-oriented languages. We
use a variant of Callahan's Program Summary Graph (PSG) and perform analysis over a set of
in
uencing nodes. Our demand driven technique has the same accuracy as the corresponding
exhaustive technique. The reduction in the graph construction time depends upon the ratio of
the cardinality of the set of in
uencing nodes and the total number of nodes in the entire program.
We present a detailed experimental evaluation of the bene ts of the demand driven technique
over the exhaustive one. We consider a number of scenarios, including resolving a single call
|
