conference-paper
وصول مفتوح
Memory Checking Requires Logarithmic Overhead
Research footprint
At a glance
- الاستشهادات
- 2
- المراجع
- 34
- Comments
- 0
Paper overview
Abstract
We study the complexity of memory checkers with computational security and prove the first general tight lower bound.
Record transparency
Publication details
- DOI
- 10.1145/3618260.3649686
- OpenAlex
- W4399523497
- Document type
- conference-paper
- Language
- EN
- Last metadata update
Comments
تسجيل الدخول للانضمام إلى النقاش.