Defending against heap overflow by using randomization in nested virtual clusters Chee Meng Tey and Debin Gao Singapore Management University, Singapore {cmtey.2008,dbgao - Heap overflow - Document - PDFSEARCH.IO

First Page	Meta Content
	Defending against heap overflow by using randomization in nested virtual clusters Chee Meng Tey and Debin Gao Singapore Management University, Singapore {cmtey.2008,dbgao}@smu.edu.sg Add to Reading List Document Date: 2014-12-17 01:40:50 Open Document File Size: 350,76 KB Share Result on Facebook / Facility Debin Gao Singapore Management University / / IndustryTerm allocator algorithm / allocation algorithm / / OperatingSystem OpenBSD / / Organization Debin Gao Singapore Management University / Singapore / / Person Meng Tey / / Technology alternative allocation algorithm / allocator algorithm / / SocialTag Fragmentation C dynamic memory allocation Address space layout randomization Data cluster File system fragmentation New Buffer overflow Allocator Computing Computer programming

Defending against heap overflow by using randomization in nested virtual clusters Chee Meng Tey and Debin Gao Singapore Management University, Singapore {cmtey.2008,dbgao}@smu.edu.sgAdd to Reading List