Simultaneous demand-driven data-flow and call graph analysis

Gagan Agrawal

doi:10.1109/icsm.1999.792643

Simultaneous demand-driven data-flow and call graph analysis

Gagan Agrawal

Research output: Contribution to conference › Paper › peer-review

12 Scopus citations

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	https://doi.org/10.1109/icsm.1999.792643
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

Access to Document

10.1109/icsm.1999.792643

Cite this

@conference{37bdc3225a404152954c6c38e6156bf2,

title = "Simultaneous demand-driven data-flow and call graph analysis",

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.",

author = "Gagan Agrawal",

note = "Copyright: Copyright 2020 Elsevier B.V., All rights reserved.; Proceedings of the 1999 IEEE International Conference on Software Maintenance (ICSM'99) ; Conference date: 30-08-1999 Through 03-09-1999",

year = "1999",

doi = "10.1109/icsm.1999.792643",

language = "English (US)",

pages = "453--462",

}

TY - CONF

T1 - Simultaneous demand-driven data-flow and call graph analysis

AU - Agrawal, Gagan

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0033350214&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033350214&partnerID=8YFLogxK

U2 - 10.1109/icsm.1999.792643

DO - 10.1109/icsm.1999.792643

M3 - Paper

AN - SCOPUS:0033350214

SP - 453

EP - 462

T2 - Proceedings of the 1999 IEEE International Conference on Software Maintenance (ICSM'99)

Y2 - 30 August 1999 through 3 September 1999

ER -

Simultaneous demand-driven data-flow and call graph analysis

Abstract

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this