BeePL: Correct-by-compilation kernel extensions
This program is tentative and subject to change.
eBPF is a revolutionary technology, which can be used to add additional capabilities to the kernel without changing the kernel source code or implementing kernel modules. The kernel is a critical part of the computer and requires extra precautions to ensure safety and avoid manhandling of the privileged data. To ensure this safety, the toolchain of eBPF includes a verifier, which ensures safety requirements before loading the program in the kernel. However, various research findings and experiments have proved that the verifier needs to be stronger in ensuring safety than it claims. A significant amount of work has been done to improve the capabilities of the verifier, and it is still an ongoing challenge. We propose a new eBPF programming language called BeePL, whose type system encodes the eBPF specifications and a formally verified compiler that preserves the properties until the BPF bytecode.
This program is tentative and subject to change.
Mon 20 JanDisplayed time zone: Mountain Time (US & Canada) change
16:00 - 17:30 | |||
16:00 24mTalk | BeePL: Correct-by-compilation kernel extensions PriSC Swarn Priya Virginia Tech, Tim Steenvoorden Open Universiteit, Connor Sughrue Virginia Tech, Frédéric Besson Inria, Rennes, Freek Verbeek Open Universiteit & Virginia Tech | ||
16:25 24mTalk | Non-Interference Preserving and Optimising Compilation with Hyperproperty Simulations PriSC Julian Rosemann Saarland University, Saarland Informatics Campus, Sebastian Hack Saarland University, Saarland Informatics Campus, Deepak Garg MPI-SWS | ||
16:50 24mTalk | SNIP: Speculative Execution and Non-Interference Preservation for Compiler Transformations PriSC | ||
17:15 15mDay closing | Closing Remarks PriSC |