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

Authors

102

  1. JW
    Jack W. Davidson

    University of Virginia, United States

    9 publications · 329 citations

    9

    h-index

  2. CW
    Christopher W. Fraser

    University of Arizona, United States

    8 publications · 293 citations

    8

    h-index

  3. SN
    Santosh Nagarakatte

    Rutgers, The State University of New Jersey, United States

    5 publications · 203 citations

    5

    h-index

  4. DM
    David Menendez

    Microsoft Research (United Kingdom), United Kingdom

    5 publications · 203 citations

    5

    h-index

  5. AA
    Alex Aiken

    Stanford University, United States

    4 publications · 280 citations

    4

    h-index

1–5 of 102

Venues

  1. ACM SIGPLAN Notices

    5 publications · 283 citations

    5

    h-index

  2. Software Practice and Experience

    4 publications · 118 citations

    4

    h-index

  3. 4

    h-index

  4. Communications of the ACM

    3 publications · 199 citations

    3

    h-index

  5. ACM SIGARCH Computer Architecture News

    2 publications · 65 citations

    2

    h-index

1–5