{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,31]],"date-time":"2026-10-31T16:28:55Z","timestamp":1793464135332,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,10,4]],"date-time":"2010-10-04T00:00:00Z","timestamp":1286150400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,10,4]]},"DOI":"10.1145\/1866307.1866371","type":"proceedings-article","created":{"date-parts":[[2010,10,5]],"date-time":"2010-10-05T14:38:23Z","timestamp":1286289503000},"page":"573-584","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":143,"title":["DieHarder"],"prefix":"10.1145","author":[{"given":"Gene","family":"Novark","sequence":"first","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Emery D.","family":"Berger","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,10,4]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Black Hat USA","author":"Afek J.","year":"2007","unstructured":"}} J. Afek and A. Sharabani . Dangling pointer: Smashing the pointer for fun and profit . In Black Hat USA , 2007 . }}J. Afek and A. Sharabani. Dangling pointer: Smashing the pointer for fun and profit. In Black Hat USA, 2007."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.30"},{"key":"e_1_3_2_1_3_1","first-page":"51","volume-title":"Proceedings of the 18th USENIX Security Symposium","author":"Akritidis P.","year":"2009","unstructured":"}} P. Akritidis , M. Costa , M. Castro , and S. Hand . Baggy bounds checking: An efficient and backwards-compatible defense against out-of-bounds errors . In Proceedings of the 18th USENIX Security Symposium , pages 51 -- 66 . USENIX, Aug. 2009 . }}P. Akritidis, M. Costa, M. Castro, and S. Hand. Baggy bounds checking: An efficient and backwards-compatible defense against out-of-bounds errors. In Proceedings of the 18th USENIX Security Symposium, pages 51--66. USENIX, Aug. 2009."},{"key":"e_1_3_2_1_4_1","volume-title":"Defeating Microsoft Windows XP SP2 heap protection and DEP bypass","author":"Anisimov A.","year":"2005","unstructured":"}} A. Anisimov . Defeating Microsoft Windows XP SP2 heap protection and DEP bypass , 2005 . }}A. Anisimov. Defeating Microsoft Windows XP SP2 heap protection and DEP bypass, 2005."},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of the 13th USENIX Security Symposium. USENIX","author":"Avijit K.","year":"2004","unstructured":"}} K. Avijit , P. Gupta , and D. Gupta . Tied, libsafeplus: Tools for runtime buffer overflow protection . In Proceedings of the 13th USENIX Security Symposium. USENIX , Aug. 2004 . }}K. Avijit, P. Gupta, and D. Gupta. Tied, libsafeplus: Tools for runtime buffer overflow protection. In Proceedings of the 13th USENIX Security Symposium. USENIX, Aug. 2004."},{"key":"e_1_3_2_1_6_1","unstructured":"}}BBP. BSD heap smashing. http:\/\/www.ouah.org\/BSD-heap-smashing.txt.  }}BBP. BSD heap smashing. http:\/\/www.ouah.org\/BSD-heap-smashing.txt."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134000"},{"key":"e_1_3_2_1_10_1","first-page":"105","volume-title":"Proceedings of the 12th USENIX Security Symposium","author":"Bhatkar S.","year":"2003","unstructured":"}} S. Bhatkar , D. C. DuVarney , and R. Sekar . Address obfuscation: An efficient approach to combat a broad range of memory error exploits . In Proceedings of the 12th USENIX Security Symposium , pages 105 -- 120 . USENIX, Aug. 2003 . }}S. Bhatkar, D. C. DuVarney, and R. Sekar. Address obfuscation: An efficient approach to combat a broad range of memory error exploits. In Proceedings of the 12th USENIX Security Symposium, pages 105--120. USENIX, Aug. 2003."},{"key":"e_1_3_2_1_11_1","first-page":"271","volume-title":"Proceedings of the 14th USENIX Security Symposium","author":"Bhatkar S.","year":"2005","unstructured":"}} S. Bhatkar , R. Sekar , and D. C. DuVarney . Efficient techniques for comprehensive protection from memory error exploits . In Proceedings of the 14th USENIX Security Symposium , pages 271 -- 286 . USENIX, Aug. 2005 . }}S. Bhatkar, R. Sekar, and D. C. DuVarney. Efficient techniques for comprehensive protection from memory error exploits. In Proceedings of the 14th USENIX Security Symposium, pages 271--286. USENIX, Aug. 2005."},{"key":"e_1_3_2_1_12_1","unstructured":"}}M. Conover and the w00w00 Security Team. w00w00 on heap overflows. http:\/\/www.w00w00.org\/files\/articles\/heaptut.txt January 1999.  }}M. Conover and the w00w00 Security Team. w00w00 on heap overflows. http:\/\/www.w00w00.org\/files\/articles\/heaptut.txt January 1999."},{"key":"e_1_3_2_1_13_1","volume-title":"Black Hat USA","author":"Ferguson J. N.","year":"2007","unstructured":"}} J. N. Ferguson . Understanding the heap by breaking it . In Black Hat USA , 2007 . }}J. N. Ferguson. Understanding the heap by breaking it. In Black Hat USA, 2007."},{"key":"e_1_3_2_1_14_1","unstructured":"}}S. Gonchigar. Ani vulnerability: History repeats. http:\/\/www.sans.org\/reading_room\/whitepapers\/threats\/ani-vulnerability-%history-repeats_1926 2007.  }}S. Gonchigar. Ani vulnerability: History repeats. http:\/\/www.sans.org\/reading_room\/whitepapers\/threats\/ani-vulnerability-%history-repeats_1926 2007."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380100607"},{"key":"e_1_3_2_1_16_1","unstructured":"}}P.-H. Kamp. Malloc(3) revisited. http:\/\/phk.freebsd.dk\/pubs\/malloc.pdf.   }}P.-H. Kamp. Malloc(3) revisited. http:\/\/phk.freebsd.dk\/pubs\/malloc.pdf."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1168857.1168884"},{"key":"e_1_3_2_1_18_1","unstructured":"}}D. Lea. A memory allocator. http:\/\/gee.cs.oswego.edu\/dl\/html\/malloc.html 1997.  }}D. Lea. A memory allocator. http:\/\/gee.cs.oswego.edu\/dl\/html\/malloc.html 1997."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1346281.1346296"},{"key":"e_1_3_2_1_20_1","volume-title":"Black Hat USA","author":"McDonald J.","year":"2009","unstructured":"}} J. McDonald and C. Valasek . Practical Windows XP\/2003 heap exploitation . In Black Hat USA , 2009 . }}J. McDonald and C. Valasek. Practical Windows XP\/2003 heap exploitation. In Black Hat USA, 2009."},{"key":"e_1_3_2_1_21_1","unstructured":"}}Microsoft Corporation. Pageheap. http:\/\/support.microsoft.com\/kb\/286470.  }}Microsoft Corporation. Pageheap. http:\/\/support.microsoft.com\/kb\/286470."},{"key":"e_1_3_2_1_22_1","volume-title":"EuroBSDCon","author":"Moerbeek O.","year":"2009","unstructured":"}} O. Moerbeek . A new malloc(3) for OpenBSD . In EuroBSDCon , 2009 . }}O. Moerbeek. A new malloc(3) for OpenBSD. In EuroBSDCon, 2009."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503286"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250736"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1409360.1409382"},{"key":"e_1_3_2_1_26_1","unstructured":"}}PaX Team. PaX address space layout randomization (ASLR). http:\/\/pax.grsecurity.net\/docs\/aslr.txt.  }}PaX Team. PaX address space layout randomization (ASLR). http:\/\/pax.grsecurity.net\/docs\/aslr.txt."},{"key":"e_1_3_2_1_27_1","unstructured":"}}B. Perens. Electric Fence v2.1. http:\/\/perens.com\/FreeSoftware\/ElectricFence\/.  }}B. Perens. Electric Fence v2.1. http:\/\/perens.com\/FreeSoftware\/ElectricFence\/."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629585"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1095810.1095833"},{"key":"e_1_3_2_1_30_1","first-page":"169","volume-title":"Proceedings of the 18th USENIX Security Symposium","author":"Ratanaworabhan P.","year":"2009","unstructured":"}} P. Ratanaworabhan , B. Livshits , and B. Zorn . Nozzle: A defense against heap-spraying code injection attacks . In Proceedings of the 18th USENIX Security Symposium , pages 169 -- 186 . USENIX, Aug. 2009 . }}P. Ratanaworabhan, B. Livshits, and B. Zorn. Nozzle: A defense against heap-spraying code injection attacks. In Proceedings of the 18th USENIX Security Symposium, pages 169--186. USENIX, Aug. 2009."},{"key":"e_1_3_2_1_31_1","first-page":"51","volume-title":"LISA '03: Proceedings of the 17th Large Installation Systems Administration Conference","author":"Robertson W.","year":"2003","unstructured":"}} W. Robertson , C. Kruegel , D. Mutz , and F. Valeur . Run-time detection of heap-based overflows . In LISA '03: Proceedings of the 17th Large Installation Systems Administration Conference , pages 51 -- 60 . USENIX, 2003 . }}W. Robertson, C. Kruegel, D. Mutz, and F. Valeur. Run-time detection of heap-based overflows. In LISA '03: Proceedings of the 17th Large Installation Systems Administration Conference, pages 51--60. USENIX, 2003."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1030083.1030124"},{"key":"e_1_3_2_1_33_1","unstructured":"}}Solar Designer. JPEG COM marker processing vulnerability in Netscape browsers. http:\/\/www.openwall.com\/advisories\/OW-002-netscape-jpeg\/ 2000.  }}Solar Designer. JPEG COM marker processing vulnerability in Netscape browsers. http:\/\/www.openwall.com\/advisories\/OW-002-netscape-jpeg\/ 2000."},{"key":"e_1_3_2_1_34_1","volume-title":"Black Hat Europe","author":"Sotirov A.","year":"2007","unstructured":"}} A. Sotirov . Heap Feng Shui in JavaScript . In Black Hat Europe , 2007 . }}A. Sotirov. Heap Feng Shui in JavaScript. In Black Hat Europe, 2007."},{"key":"e_1_3_2_1_35_1","unstructured":"}}O. Whitehouse. An analysis of address space layout randomization on Windows Vista. http:\/\/www.symantec.com\/avcenter\/reference\/Address_Space_Layout_Randomi%zation.pdf 2007.  }}O. Whitehouse. An analysis of address space layout randomization on Windows Vista. http:\/\/www.symantec.com\/avcenter\/reference\/Address_Space_Layout_Randomi%zation.pdf 2007."},{"key":"e_1_3_2_1_36_1","volume-title":"Dangling pointer -- Wikipedia, the free encyclopedia","year":"2010","unstructured":"}}Wikipedia. Dangling pointer -- Wikipedia, the free encyclopedia , 2010 . {Online; accessed 16-April-2010}. }}Wikipedia. Dangling pointer -- Wikipedia, the free encyclopedia, 2010. {Online; accessed 16-April-2010}."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/645647.664690"}],"event":{"name":"CCS '10: 17th ACM Conference on Computer and Communications Security 2010","location":"Chicago Illinois USA","acronym":"CCS '10","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 17th ACM conference on Computer and communications security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1866307.1866371","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1866307.1866371","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:08:59Z","timestamp":1750248539000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1866307.1866371"}},"subtitle":["securing the heap"],"short-title":[],"issued":{"date-parts":[[2010,10,4]]},"references-count":35,"alternative-id":["10.1145\/1866307.1866371","10.1145\/1866307"],"URL":"https:\/\/doi.org\/10.1145\/1866307.1866371","relation":{},"subject":[],"published":{"date-parts":[[2010,10,4]]},"assertion":[{"value":"2010-10-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}