Peephole Optimization
Peephole Optimization is a compiler optimization technique that improves generated code by examining a small, sliding window of consecutive instructions (the "peephole") and replacing inefficient sequences with equivalent but faster or smaller ones based on local pattern matching and algebraic simplification.
55
Publications
2.7K
Citations
102
Authors
58
Institutions
Publications per year
2017–2026
6
55
Superoptimizer: a look at the smallest program
Henry Massalin · ACM SIGPLAN Notices · 1987 · 229 citations
Automatic generation of peephole superoptimizers
Sorav Bansal, Alex Aiken · 2006 · 166 citations
W. M. McKeeman · Communications of the ACM · 1965 · 155 citations · Full text
Superoptimizer: a look at the smallest program
Henry Massalin · 1987 · 152 citations · Full text
Provably correct peephole optimizations with alive
Nuno P. Lopes, David Menendez, Santosh Nagarakatte et al. · 2015 · 130 citations
1–5 of 55
102
9
h-index
8
h-index
Rutgers, The State University of New Jersey, United States
5 publications · 203 citations
5
h-index
5
h-index
4
h-index
1–5 of 102
58
Stanford University
Stanford, United States
7 h-index
11 publications
782 citations
University of Arizona
Tucson, United States
7 h-index
11 publications
442 citations
University of Virginia
Charlottesville, United States
6 h-index
7 publications
203 citations
Columbia University
New York, United States
6 h-index
8 publications
555 citations
University of Utah
Salt Lake City, United States
4 h-index
6 publications
221 citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
3 h-index
3 publications
176 citations
IBM (United States)
Armonk, United States
3 h-index
4 publications
296 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
3 h-index
6 publications
330 citations
1–8 of 58
5 publications · 283 citations
5
h-index
4 publications · 118 citations
4
h-index
4 publications · 287 citations
4
h-index
3 publications · 199 citations
3
h-index
2 publications · 65 citations
2
h-index
1–5