Gagan Agrawal  Home/Search
Context Related
| udel.edu/~agrawal/Anbib/.....icsm99.ps Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: udel.edu/~agrawal/Anbib/node4 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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... (Update)
Context of citations to this paper: More
.... only those parts of the program required to compute an analysis fact at a subset of the program points or to answer a given query [2, 10, 8, 11]. Like demand driven analyses, our analysis does not analyze those parts of the program that do not affect the desired analysis...
.... researchers have worked on demand driven analysis but in a substantially different way (see the work of Duesterwald et al. 5] Agrawal [1], and Heintze and Tardieu [6] These approaches do not have an abstract execution model that changes to suit the program. Their goal is...
Cited by: More
Incrementalized Pointer and Escape Analysis - Vivien, Rinard (2001) (Correct)
Demand-Driven Type Analysis for Dynamically-Typed Functional.. - Dubé (Correct)
A Demand-Driven Adaptive Type Analysis - Dubé, Feeley (Correct)
Similar documents (at the sentence level):
25.1%: Evaluating a Demand Driven Technique for Call Graph Construction - Agrawal, Li, Su (2002) (Correct)
Active bibliography (related documents): More All
0.3: Generation of efficient interprocedural analyzers with PAG - Alt, Martin (1995) (Correct)
0.2: Effective Interprocedural Optimization of Object-Oriented Languages - Grove (1998) (Correct)
0.2: Efficient Flow-Insensitive Alias Analysis in the.. - Burke, Carini, Choi.. (Correct)
Similar documents based on text: More All
0.1: Evaluating Explicitly Context-Sensitive Program Slicing - Agrawal, Guo (2001) (Correct)
0.1: The Design and Implementation of RAP: A PDG-based Register.. - Norris, Pollock (1998) (Correct)
0.1: Advanced Compiler and Runtime Support for Data Intensive.. - Ferreira, Agrawal, Saltz (Correct)
Related documents from co-citation: More All
3: Demand-driven interprocedural array property analysis (context) - Lin, Padua - 1999
3: Optimizing the use of high performance libraries (context) - Guyer, Lin - 2000
3: Removing Unnecessary Synchronization in Java - Bogda, olzle - 1999
BibTeX entry: (Update)
G. Agrawal. Simultaneous demand-driven data-flow and call graph analysis. In Proceedings of the 1999 International Conference on Software Maintenance, Oxford, UK, Aug. 1999. http://citeseer.ist.psu.edu/agrawal99simultaneous.html More
@inproceedings{ agrawal99simultaneous,
author = "Gagan Agrawal",
title = "Simultaneous Demand-Driven Data-Flow and Call Graph Analysis",
booktitle = "{ICSM}",
pages = "453-462",
year = "1999",
url = "citeseer.ist.psu.edu/agrawal99simultaneous.html" }
Citations (may not include all citations):1399 Compilers: Principles (context) - Aho, Sethi et al. - 1986
246 Context-sensitive interprocedural Points-to analysis in the .. - Emami, Ghiya et al. - 1994
175 A safe approximate algorithm for interprocedural pointer ali.. - Landi, Ryder - 1992
151 Objectoriented type inference - Palsberg, Schwartzbach - 1991
149 Precise concrete type inference for object-oriented language.. - Plevyak, Chien - 1994
127 Control-flow analysis in Scheme (context) - Shivers - 1988
88 A type system equivalent to flow analysis - Palsberg, O'Keefe - 1995
86 A precise interprocedural data flow algorithm (context) - Myers - 1981
85 Reducing indirect function call overhead in C++ programs - Calder, Grunwald - 1994
76 The program summary graph and flowsensitive interprocedural .. (context) - Callahan - 1988
70 An interval-based approach to exhaustive and incremental int.. (context) - Burke - 1990
68 Interprocedural data flow analysis in the presence of pointe.. - Weihl - 1980
64 Fast static analysis of c++ virtual function calls - Bacon, Sweeney - 1996
62 Selective specialization for object-oriented languages - Dean, Chambers et al. - 1995
59 Demand interprocedural dataflow analysis - Horwitz, Reps et al. - 1995
57 Fast interprocedural class analysis - DeFouw, Grove et al. - 1998
47 Simple and effective analysis of statically typed objectorie.. - Diwan, Moss et al. - 1996
41 The semantics of Scheme control-flow analysis - Shivers - 1991
36 IEEE Transactions on Software Engineering (context) - Ryder, call et al. - 1979
30 ACM Letters on Programming Languages and Systems (context) - Hall, Kennedy et al. - 1992
29 Constructing call multigraphs using dependence graphs - Lakhotia - 1993
24 Call graph construction in object-oriented languages (context) - Grove, DeFouw et al. - 1997
19 Data-flow-based virtual function resolution - Pande, Ryder - 1996
12 Efficient computation of interprocedural definition-use chai.. (context) - Harrold, Soffa - 1994
10 IEEE Transactions on Software Engineering (context) - Rothermel, Harrold et al. - 1996
3 Demand-driven computation of interprocedual data flow (context) - Duesterwald, Gupta et al. - 1995
Documents on the same site (http://www.cis.udel.edu/~agrawal/An-bib/node4.html):
Evaluating a Demand Driven Technique for Call Graph Construction - Agrawal, Li, Su (2002) (Correct)
Evaluating Explicitly Context-Sensitive Program Slicing - Agrawal, Guo (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC