Interprocedural Optimization is a compiler optimization technique that analyzes and transforms code across function boundaries to improve program performance by enabling optimizations such as inlining, constant propagation, and dead code elimination at the procedure level.
135
Publications
9.1K
Citations
265
Authors
94
Institutions
Publications per year
2017–2026
6
Parents
Publications
135
Jong-Deok Choi, Manish Gupta, Maurício Serrano et al. · 1999 · 505 citations · Full text
Translation validation for an optimizing compiler
George C. Necula · 2000 · 487 citations
Call graph construction in object-oriented languages
David Grove, Greg DeFouw, Jeffrey A. Dean et al. · 1997 · 296 citations · Full text
1–5 of 135
Authors
265
- KK
11
h-index
- KD
8
h-index
- CC
6
h-index
- SL
6
h-index
- MH
5
h-index
1–5 of 265
Institutions
94
Rice University
Houston, United States
13 h-index
36 publications
2.5K citations
University of Washington
Seattle, United States
7 h-index
21 publications
2.3K citations
IBM (United States)
Armonk, United States
6 h-index
23 publications
4.4K citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
5 h-index
9 publications
288 citations
Princeton University
Princeton, United States
4 h-index
14 publications
654 citations
University of Arizona
Tucson, United States
4 h-index
9 publications
652 citations
Google (United States)
Mountain View, United States
4 h-index
24 publications
605 citations
Ghent University
Ghent, Belgium
4 h-index
4 publications
375 citations
1–8 of 94
Venues
- ACM SIGPLAN Notices
19 publications · 1.1K citations
14
h-index
- ACM Transactions on Programming Languages and Systems
6 publications · 813 citations
6
h-index
- Computer Languages
2 publications · 134 citations
2
h-index
- LISP and Symbolic Computation
2 publications · 162 citations
2
h-index
- Communications of the ACM
2 publications · 825 citations
2
h-index
1–5