Summary: Simultaneous Demand­Driven Data­flow and Call Graph Analysis
Gagan Agrawal
Department of Computer and Information Sciences
University of Delaware
Newark DE 19716
(302)­831­2783
agrawal@cis.udel.edu
Abstract
Recently, there has been much interest in per­
forming demand­driven data­flow analysis in software
development environments. Demand­driven analysis
techniques compute data­flow fact(s) for a particular
program point, rather than computing data­flow infor­
mation for the entire program. The existing work in
this area, however, assumes that the static call graph
is available for the entire program. Constructing ex­
haustive call graphs can be extremely time and space
inefficient for large object­oriented programs. There­
fore, it is desirable to compute the call graph infor­
mation on a demand basis as well. In this paper, we

Source: Agrawal, Gagan - Department of Computer Science and Engineering, Ohio State University

Collections: Computer Technologies and Information Sciences