University of Cambridge > Talks.cam > Computer Laboratory Systems Research Group Seminar > Baggy Bounds Checking: An Efficient and Backwards-Compatible Defense against Out-of-Bounds Errors

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Baggy Bounds Checking: An Efficient and Backwards-Compatible Defense against Out-of-Bounds Errors

Download to your calendar using vCal

If you have a question about this talk, please contact Eiko Yoneki .

Attacks that exploit out-of-bounds errors in C and C++ programs are still prevalent despite many years of research on bounds checking. We present a backwards compatible bounds checking technique that substantially reduces performance overhead. The key insight is to constrain the sizes of allocated memory regions and their alignment to enable efficient bounds lookups and efficient bounds checks at runtime. Our technique is three times faster—using less memory— than the fastest previous technique.

This talk is part of the Computer Laboratory Systems Research Group Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Sociology Department, Old Cavendish Laboratory, Free School Lane Ray Dolby Centre Hybrid: in-person in Cambridge & online via Teams

Other talks

Morning Break / Group Photo Online Causal Inference Semina Title TBC Strange New Worlds The Importance of Teaching about Science and Religion in a Time of Global Uncertainty Paediatric Medicine and Rheumatology
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity