Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore advanced techniques for implementing robust array bounds-checking mechanisms in C programming and Linux kernel development through this comprehensive conference talk. Discover how the Linux Kernel Self-Protection Project addresses historical vulnerabilities in C's array handling by examining cutting-edge hardening strategies for fixed-size and flexible arrays. Learn about innovative approaches to fortifying critical APIs like memcpy() against buffer overflow attacks, including the implementation of specialized built-in compiler functions and runtime protection mechanisms. Delve into recent compiler enhancements such as the -fstrict-flex-arrays and -Wflex-array-member-not-at-end options, and understand how the new counted_by attribute in Clang 18 and GCC 15 enables comprehensive runtime bounds-checking for flexible arrays. Gain insights into the technical challenges overcome in developing these security measures and examine the groundbreaking innovations that aim to eliminate array bounds-checking vulnerabilities in both C programming and Linux kernel environments permanently.
