BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Baggy Bounds Checking: An Efficient and Backwards-Compatible Defen
 se against Out-of-Bounds Errors - Periklis Akritidis (University of Cambri
 dge)
DTSTART:20090604T150000Z
DTEND:20090604T160000Z
UID:TALK18018@talks.cam.ac.uk
CONTACT:Eiko Yoneki
DESCRIPTION:Attacks that exploit out-of-bounds errors in C and C++ program
 s are still prevalent despite many years of research on bounds checking. W
 e present a backwards compatible bounds checking technique that substantia
 lly reduces performance overhead. The key insight is to constrain the size
 s of allocated memory regions and their alignment to enable efficient boun
 ds lookups and efficient bounds checks at runtime. Our technique is three 
 times faster—using less memory— than the fastest previous technique.\n
LOCATION:FW26\, Computer Laboratory\, William Gates Builiding
END:VEVENT
END:VCALENDAR