A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation - PLDI '06
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. We present DieHard, a runtime system that tolerates these errors while probabilistically maintaining soundness. DieHard uses randomization and replication to achieve probabilistic memory safety by approximating an infinite-sized heap.doi:10.1145/1133981.1134000 dblp:conf/pldi/BergerZ06 fatcat:zk7cgxjlfbg2da2i4uhdbbyvc4