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
60
Choice Reviews Online · 2013 · 253 citations
Transparent runtime randomization for security
Jun Xu, Zbigniew Kalbarczyk, R.K. Iyer · 2004 · 248 citations · Full text
GPTScan: Detecting Logic Vulnerabilities in Smart Contracts by Combining GPT with Program Analysis
Yuqiang Sun, Daoyuan Wu, Yue Xue et al. · 2024 · 134 citations · Full text
1–5 of 60
154
Massachusetts Institute of Technology, United States
4 publications · 239 citations
4
h-index
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 154
66
Microsoft (United States)
Redmond, United States
4 h-index
9 publications
294 citations
University of Illinois Urbana-Champaign
Urbana, United States
4 h-index
11 publications
1.2K citations
University of Utah
Salt Lake City, United States
3 h-index
5 publications
322 citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
12 publications
796 citations

East China Normal University
Shanghai, China
2 h-index
9 publications
246 citations

Lehigh University
Bethlehem, United States
2 h-index
4 publications
71 citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
2 h-index
2 publications
60 citations

Xi'an Jiaotong University
Xi'an, China
2 h-index
9 publications
246 citations
1–8 of 66
Repository · 4 publications · 174 citations
4
h-index
4 publications · 60 citations
4
h-index
2 publications · 48 citations
2
h-index
2 publications · 116 citations
2
h-index
1 publications · 26 citations
1
h-index
1–5