Call Graph Construction
Call Graph Construction is a static program analysis method that, as a specialized form of control-flow analysis, identifies and models the potential calling relationships between functions in a program by determining the set of possible callees for each function call site.
143
Publications
7.3K
Citations
359
Authors
134
Institutions
Publications per year
2017–2026
28
Parents
143
Constructing the Call Graph of a Program
Barbara G. Ryder · IEEE Transactions on Software Engineering · 1979 · 300 citations
Call graph construction in object-oriented languages
David Grove, Greg DeFouw, Jeffrey A. Dean et al. · 1997 · 296 citations · Full text
Practical virtual method call resolution for Java
Vijay Sundaresan, Laurie Hendren, Chrislain Razafimahefa et al. · 2000 · 290 citations · Full text
Scalable propagation-based call graph construction algorithms
Frank Tip, Jens Palsberg · 2000 · 264 citations
1–5 of 143
359
7
h-index
Rutgers, The State University of New Jersey, United States
7 publications · 450 citations
7
h-index
5
h-index
5
h-index
4
h-index
1–5 of 359
134
IBM (United States)
Armonk, United States
10 h-index
25 publications
2.3K citations
University of Washington
Seattle, United States
7 h-index
23 publications
3.4K citations

University of Waterloo
Waterloo, Canada
7 h-index
12 publications
506 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
6 h-index
11 publications
532 citations
Microsoft (United States)
Redmond, United States
5 h-index
9 publications
346 citations

Rice University
Houston, United States
5 h-index
11 publications
934 citations

Aarhus University
Aarhus, Denmark
5 h-index
8 publications
338 citations
University of Illinois Urbana-Champaign
Urbana, United States
5 h-index
12 publications
1.2K citations
1–8 of 134
14 publications · 716 citations
13
h-index
TSE · 6 publications · 571 citations
6
h-index
3 publications · 208 citations
3
h-index
2 publications · 30 citations
2
h-index
2 publications · 54 citations
2
h-index
1–5