Explore a 15-minute IEEE conference talk that delves into the precise detection of kernel data races using probabilistic lockset analysis. Learn about the innovative approach presented by researchers from Columbia University, including Gabriel Ryan, Abhishek Shah, Dongdong She, and Suman Jana. Gain insights into how this method enhances the accuracy of identifying data races in kernel-level programming, potentially improving system stability and performance.
Precise Detection of Kernel Data Races with Probabilistic Lockset Analysis
Overview
Syllabus
Precise Detection of Kernel Data Races with Probabilistic Lockset Analysis
Taught by
IEEE Symposium on Security and Privacy
Tags
Related Courses
-
OSPREY - Recovery of Variable and Data Structure via Probabilistic Analysis for Stripped Binary
-
Confident Monte Carlo - Rigorous Analysis of Guessing Curves for Probabilistic Password Models
-
GREBE - Unveiling Exploitation Potential for Linux Kernel Bugs
-
SyzDescribe - Principled, Automated, Static Generation of Syscall Descriptions for Kernel Drivers
-
GraphSPD - Graph-Based Security Patch Detection with Enriched Code Semantics
-
DynPTA: Combining Static and Dynamic Analysis for Practical Selective Data Protection
