BEGIN:VCALENDAR
CALSCALE:GREGORIAN
VERSION:2.0
METHOD:PUBLISH
PRODID:-//Drupal iCal API//EN
X-WR-TIMEZONE:America/New_York
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
DTSTART:20070311T020000
TZNAME:EDT
TZOFFSETTO:-0400
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
DTSTART:20071104T020000
TZNAME:EST
TZOFFSETTO:-0500
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
SEQUENCE:1
X-APPLE-TRAVEL-ADVISORY-BEHAVIOR:AUTOMATIC
234391
20260408T141153Z
DTSTART;TZID=America/New_York:20260414T130000
DTEND;TZID=America/New_York:2
 0260414T140000
URL;TYPE=URI:https://www.wpi.edu/news/calendar/events/compu
 ter-science-department-ms-thesis-presentation-alden-cutler-making-secure-b
 ounce-allocator
Computer Science Department , MS Thesis Presentation , Alden Cutler "Making a Secure Bounce Allocator Practical in the Linux Kernel"
Alden Cutler\nMS student\nWPI – Computer Science Department\n\nTuesday, April 14, 2026\nTime:
  1:00 p.m. – 2:30 p.m.\nLocation: Fuller Labs 141\n\nZoom Link:https://w
 pi.zoom.us/j/92131497768\n\nAdvisor: Prof. Robert Walls\nReader: Prof. Xia
 oyan Sun\n\nAbstract:\n\nTemporal memory safety vulnerabilities such as us
 e-after-free remain a major security risk in the Linux kernel. The Bounce 
 Allocator is a promising defense that combines pointer indirection with ha
 rdware memory tagging, but deploying it directly requires many manual sour
 ce edits.\nThis thesis investigates whether compiler-assisted instrumentat
 ion can reduce that integration effort. I implement an LLVM IR pass that r
 ewrites supported allocation, free, and pointer-use patterns to automatica
 lly apply bounce allocator protections. The pass finds candidate allocator
  calls, recovers pointer intent using instruction-use analysis with option
 al debug metadata, and inserts the required indirection while handling com
 mon kernel patterns such as zero-initialized allocations and pointer casts
 .\nI evaluate this approach by building and deploying an instrumented Andr
 oid kernel on ARM hardware with Memory Tagging Extension (MTE) support. Th
 e results show a clear tradeoff: much lower manual integration effort in e
 xchange for added compile-time cost, with improved maintainability from ce
 ntralizing integration in the compiler pass. These findings suggest compil
 er automation is a practical path for deploying bounce allocator protectio
 ns in production-scale kernels.\n\n
END:VEVENT
END:VCALENDAR