Simultaneous demand-driven data-flow and call graph analysis

Recently, there has been much interest in performing 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 information for the entire program. The existing work in this area however, assumes that the static call graph is available for the entire program. Constructing exhaustive call graphs can be extremely time and space inefficient for large object oriented programs. Therefore, it is desirable to compute the call graph information on a demand basis as well. We present an algorithm for demand-driven construction of reaching definitions, which also performs call graph analysis on a demand basis.