Abstract
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. In this paper, we present an algorithm for demand-driven construction of reaching definitions, which also performs call graph analysis on a demand basis.
| Original language | English (US) |
|---|---|
| Pages | 453-462 |
| Number of pages | 10 |
| DOIs | |
| State | Published - 1999 |
| Event | Proceedings of the 1999 IEEE International Conference on Software Maintenance (ICSM'99) - Oxford, UK Duration: Aug 30 1999 → Sep 3 1999 |
Conference
| Conference | Proceedings of the 1999 IEEE International Conference on Software Maintenance (ICSM'99) |
|---|---|
| City | Oxford, UK |
| Period | 8/30/99 → 9/3/99 |
ASJC Scopus subject areas
- Software