Bounds Checking

Bounds Checking is a memory safety mechanism that verifies whether memory accesses lie within the permissible limits of a data structure, thereby preventing out-of-bounds access that could compromise program integrity.

102

Publications

6.4K

Citations

255

Authors

110

Institutions

Publications per year

2017–2026

13

Variants

Range Checking

Authors

255

  1. MM
    Milo M. K. Martin

    University of Pennsylvania, United States

    11 publications · 1.1K citations

    11

    h-index

  2. SZ
    Steve Zdancewic

    University of Pennsylvania, United States

    10 publications · 1.1K citations

    10

    h-index

  3. SN
    Santosh Nagarakatte

    Rutgers, The State University of New Jersey, United States

    7 publications · 824 citations

    7

    h-index

  4. RG
    Rajiv Gupta

    University of California, Riverside, United States

    4 publications · 432 citations

    4

    h-index

  5. CB
    Colin Blundell

    University of Pennsylvania, United States

    4 publications · 258 citations

    4

    h-index

1–5 of 255

Venues

  1. ACM SIGPLAN Notices

    7 publications · 225 citations

    7

    h-index

  2. 3

    h-index

  3. arXiv (Cornell University)

    Repository · 3 publications · 120 citations

    3

    h-index

  4. IEEE Transactions on Software Engineering

    TSE · 2 publications · 30 citations

    2

    h-index

  5. ACM SIGARCH Computer Architecture News

    2 publications · 123 citations

    2

    h-index

1–5