YoVDO

Compiling for Verified Targets: BPF Optimization Challenges

Offered By: Linux Plumbers Conference via YouTube

Tags

Compiler Design Courses Static Analysis Courses LLVM Courses BPF Courses GNU Toolchain Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the challenges and strategies for compiling code for verified targets, specifically focusing on the Linux kernel's Berkeley Packet Filter (BPF). Learn about the unique requirements of BPF programs, which must be verified as safe before execution in privileged kernel mode. Discover the complexities of generating verifiable machine instructions from high-level languages like C or Rust. Examine various techniques being considered to address these challenges, including IR legalization, static analysis, assembler verification, and specialized compiler passes. Gain insights into the ongoing discussions between GNU toolchain, clang/llvm, and BPF kernel communities to develop practical solutions for compiling verified targets. Understand the implications of these developments for the future of kernel programming and the potential proliferation of verifiers in other domains.

Syllabus

Compiling for verified targets BPF - Jose E Marchesi


Taught by

Linux Plumbers Conference

Related Courses

RISC-V Toolchain and Compiler Optimization Techniques
Linux Foundation via edX
The State of Julia in 2021 - JuliaCon Keynote
The Julia Programming Language via YouTube
Get Started Using WebAssembly (wasm)
egghead.io
DataFusion and Apache Arrow: Supercharging Data Analytics with a Rust-Based Query Engine
Databricks via YouTube
Compilers - Jared Shumway
White Hat Cal Poly via YouTube