Memory Safety Verification

Memory Safety Verification is a formal method within deductive verification that ensures programs do not perform unauthorized memory accesses, such as buffer overflows, null pointer dereferences, or use-after-free errors, by mathematically proving adherence to memory safety policies.

58

Publications

2.8K

Citations

182

Authors

84

Institutions

Publications per year

2017–2026

16

Authors

182

  1. MV
    Martin Vechev

    ETH Zurich, Switzerland

    4 publications · 213 citations

    4

    h-index

  2. GK
    Gerwin Klein

    UNSW Sydney, Australia

    4 publications · 276 citations

    4

    h-index

  3. HT
    Harvey Tuch

    Data61, Australia

    3 publications · 257 citations

    3

    h-index

  4. GC
    George C. Necula

    University of California, Berkeley, United States

    3 publications · 414 citations

    3

    h-index

  5. PL
    Peter Lee

    Imperial College London, United Kingdom

    3 publications · 414 citations

    3

    h-index

1–5 of 182

Venues

  1. ACM SIGPLAN Notices

    7 publications · 306 citations

    7

    h-index

  2. Journal of Automated Reasoning

    1 publications · 22 citations

    1

    h-index

  3. Journal of Functional Programming

    1 publications · 19 citations

    1

    h-index

  4. 1

    h-index

  5. login Usenix Mag.

    1 publications · 15 citations

    1

    h-index

1–5