Baggy Bounds Checking: An Efficient and Backwards-Compatible Defense against Out-of-Bounds Errors
By P. Akritidis, Manuel Costa, Miguel Oom Temudo de Castro, S. Hand. USENIX Security Symposium, 2009
320 citations recorded by the source corpus.
View Paper: https://www.semanticscholar.org/paper/9a8bf1a6e4e71f59620a53b0637c38a416966c4b
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Felix Schuster
- Lucas Davi
- Ahmad-Reza Sadeghi
- Thomas Tendyck
- Andreas Haas
- Christopher Liebchen
- Thorsten Holz
- Andreas Rossberg
Citations in the corpus
- Bringing the web up to speed with WebAssembly (2017, background): “Other attempts have enforced it at the C abstract machine level with combinations of static and runtime checks [10, 20, 31], sometimes assisted by hardware [16, 30].”
- SoK: Eternal War in Memory (2013, background): “Baggy Bounds Checking (BBC) [56] is currently one of the fastest object based bounds checkers.”
- Counterfeit Object-oriented Programming: On the Difficulty of Preventing Code Reuse Attacks in C++ Applications (2015, background): “This changed through the broad deployment of the well-known data execution prevention (DEP) countermeasure [33] that renders immediate code injection attacks infeasible.”
- SGXBOUNDS: Memory Safety for Shielded Execution (2017, result): “We have obtained similar results with SPEC CPU2006 and four real-world case studies: SQLite, Memcached, Apache, and Nginx.”