DieHard: Efficient Probabilistic Memory Safety

Applications written in unsafe languages like C and C++ are vulnerable to memory errors such as buffer overflows, dangling pointers, and reads of uninitialized data. Such errors can lead to program crashes, security vulnerabilities, and unpredictable behavior. The authors present DieHard, a randomized runtime system that tolerates these errors while probabilistically maintaining soundness. DieHard uses randomization to achieve probabilistic memory safety by approximating an infinite-sized heap. DieHard's memory manager randomizes the location of objects in a heap that dynamically adapts to be a constant factor larger than required.