(Enter summary)
Abstract: Informally, a call graph represents calls between entities
in a given program. The call graphs that compilers
compute to determine the applicability of an optimization
must typically be conservative: a call may
be omitted only if it can never occur in any execution
of the program. Numerous software engineering tools
also extract call graphs with the expectation that they
will help software engineers increase their understanding
of a program. The requirements placed on software
engineering tools ... (Update)
Cited by: More
Precise Call Graphs for C Programs with Function Pointers .. - Department Of Computer
(Correct)
Mining Co-Change Clusters from Version Repositories - Beyer, Noack (2005)
(Correct)
Source versus Object Code Extraction For Recovering Software - Architecture Ahmed Hassan (2005)
(Correct)
Active bibliography (related documents): More All
0.3: Syntax and Static Semantics of the Interlocking Design .. - Bol, Koorn, Oei, van..
(Correct)
0.3: Sablecc, An Object-Oriented Compiler Framework - Gagnon (1998)
(Correct)
0.2: A Critical Look at Design, Verification, and Validation of Large .. - Stevenson
(Correct)
Similar documents based on text: More All
0.1: Lightweight Source Model Extraction - Gail Murphy (1995)
(Correct)
0.1: International Conference on Engineering Education August .. - Exercises Erica.. (2001)
(Correct)
0.1: An Empirical Study of Java Dynamic Call Graph Extractors - David
(Correct)
Related documents from co-citation: More All
9: Evaluating architectural extractors (context) - Armstrong, Trudeau - 1998
8: Free Software Foundation (context) - Stallman, Manual - 1994
8: Software reflexion models: Bridging the gap between source and high-level models
- Murphy, Notkin et al. - 1995
BibTeX entry: (Update)
G. C. Murphy, D. Notkin, W. G. Griswold, and E. S. Lan. An empirical study of static call graph extractors. ACM Trans. on Softw. Eng. and Meth., 7(2):158--191. http://citeseer.ist.psu.edu/murphy96empirical.html More
@article{ murphy98empirical,
author = "Gail C. Murphy and David Notkin and William G. Griswold and Erica S. Lan",
title = "An empirical study of static call graph extractors",
journal = "ACM Transactions on Software Engineering and Methodology",
volume = "7",
number = "2",
pages = "158--191",
year = "1998",
url = "citeseer.ist.psu.edu/murphy96empirical.html" }
Citations (may not include all citations):
476
Programming Language (context) - Kernighan, Ritchie - 1988
271
Yacc---Yet Another Compiler Compiler
- Johnson - 1975
91
An Efficient Way to Find the Side Effects of Procedure Calls.. (context) - Banning - 1979
86
A Precise Inter-procedural Data Flow Algorithm (context) - Myers - 1981
62
IEEE Transactions on Software Engineering (context) - Chen, Nishimoto et al. - 1990
44
A Practical Interprocedural Data Flow Analysis Algorithm (context) - Barth - 1978
37
Rigi---A System for Programming-in-the-large (context) - Muller, Klashinsky - 1989
32
Efficient Computation of Flow Insensitive Interprocedural Su.. (context) - Cooper, Kennedy - 1984
30
ACM Letters on Programming Languages and Systems (context) - Hall, Kennedy et al. - 1992
29
Constructing Call Multigraphs using Dependence Graphs
- Lakhotia - 1993
24
Constructing the Procedure Call Multigraph (context) - Callahan, Carle et al. - 1990
19
Interprocedural Data Flow Analysis (context) - Allen - 1974
17
Interprocedural Optimization: Eliminating Unnecessary Recomp.. (context) - Cooper, Kennedy et al. - 1986
13
The Field Programming Environment: A Friendly Integrated Env.. (context) - Reiss - 1995
4
How Accurate is Scientific Software (context) - Hatton, Roberts - 1994
3
Technical Report Computing Science Technical Report (context) - Lesk, Analyzer - 1975
The graph only includes citing articles where the year of publication is known.
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