Главная
Study mode:
on
1
Introduction
2
Why do we do this
3
Addressbased separation protection
4
Why do we doublefetch
5
What could go wrong
6
Why is it difficult to detect
7
Dependency Lowcut
8
What can go wrong
9
Proof attacks
10
Overlap
11
Control Dependence
12
Data Dependence
13
Recap
14
Goal
15
Topdown approach
16
Some details
17
Symbolic Checking
18
Code Walkthrough
19
More Complex Example
20
Findings
21
Mitigation
22
Single fetch
23
Limitations
24
Conclusion
25
Chan
Description:
Explore a comprehensive analysis of double-fetch bugs in operating system kernels through this IEEE conference talk. Delve into the challenges of detecting these critical vulnerabilities and learn about Deadline, a static analysis system designed to automatically identify double-fetch bugs. Discover the formal definition of these bugs, understand the limitations of previous detection methods, and gain insights into the systematic approach used to find multi-reads in kernel code. Examine the specialized symbolic checking techniques employed to verify potential double-fetch bugs and review the findings from applying Deadline to Linux and FreeBSD kernels. Investigate four generic strategies proposed for patching and preventing these vulnerabilities, based on extensive research and discussions with kernel maintainers. Gain valuable knowledge about address-based separation protection, dependency analysis, and mitigation techniques to enhance operating system security.

Precise and Scalable Detection of Double-Fetch Bugs in OS Kernels

IEEE
Add to list