Integer Overflow

Integer Overflow is a computational anomaly in which an arithmetic operation produces a value that exceeds the maximum representable integer within a fixed bit-width representation, resulting in wrapping behavior due to modular arithmetic in finite precision systems.

60

Publications

2.8K

Citations

154

Authors

66

Institutions

Publications per year

2017–2026

19

Authors

154

  1. SS
    Stelios Sidiroglou-Douskos

    Massachusetts Institute of Technology, United States

    4 publications · 239 citations

    4

    h-index

  2. MR
    Martin Rinard

    Massachusetts Institute of Technology, United States

    4 publications · 239 citations

    4

    h-index

  3. FL
    Fan Long

    Massachusetts Institute of Technology, United States

    4 publications · 239 citations

    4

    h-index

  4. EL
    Eric Lahtinen

    Massachusetts Institute of Technology, United States

    3 publications · 183 citations

    3

    h-index

  5. JR
    John Regehr

    University of Utah, United States

    3 publications · 175 citations

    3

    h-index

1–5 of 154

Venues

  1. arXiv (Cornell University)

    Repository · 4 publications · 174 citations

    4

    h-index

  2. IEEE Transactions on Computers

    4 publications · 60 citations

    4

    h-index

  3. ACM SIGPLAN Notices

    2 publications · 48 citations

    2

    h-index

  4. 2

    h-index

  5. Journal of information processing

    1 publications · 26 citations

    1

    h-index

1–5