Interprocedural Dataflow Analysis
Interprocedural Dataflow Analysis is a static program analysis technique that extends intra-procedural dataflow analysis by propagating dataflow facts across procedure boundaries to compute precise global program properties in the presence of calls and returns.
213
Publications
11.5K
Citations
406
Authors
166
Institutions
Publications per year
2017–2026
17
Parents
213
Precise interprocedural dataflow analysis via graph reachability
Thomas Reps, Susan Horwitz, Mooly Sagiv · 1995 · 1.2K citations
Removing unnecessary synchronization in Java
Jeff Bogda, Urs Hölzle · 1999 · 211 citations
1–5 of 213
406
9
h-index
7
h-index
7
h-index
Rutgers, The State University of New Jersey, United States
7 publications · 226 citations
7
h-index
6
h-index
1–5 of 406
166
IBM (United States)
Armonk, United States
10 h-index
17 publications
833 citations
University of Maryland, College Park
College Park, United States
8 h-index
21 publications
2K citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
8 h-index
13 publications
808 citations

Rice University
Houston, United States
7 h-index
15 publications
1K citations
University of Wisconsin–Madison
Madison, United States
7 h-index
14 publications
5.1K citations
Rutgers, The State University of New Jersey
New Brunswick, United States
7 h-index
13 publications
413 citations
University of Pittsburgh
Pittsburgh, United States
6 h-index
14 publications
1K citations
Colorado State University
Fort Collins, United States
5 h-index
14 publications
267 citations
1–8 of 166
19 publications · 781 citations
13
h-index
8 publications · 537 citations
8
h-index
TSE · 7 publications · 255 citations
7
h-index
SEN · 4 publications · 134 citations
4
h-index
PACMPL · 3 publications · 192 citations
3
h-index
1–5