Alexandre Jean Gautier
Formal Analysis of eBPF Helper Functions and Ring Buffer Synchronization via SPIN Model Checking.
Rel. Riccardo Sisto, Rosario Rizza. Politecnico di Torino, Corso di laurea magistrale in Cybersecurity, 2026
|
Preview |
PDF (Tesi_di_laurea)
- Tesi
Licenza: Creative Commons Attribution Non-commercial No Derivatives. Download (5MB) | Preview |
Abstract
Extended Berkeley Packet Filter (eBPF) has become an increasingly powerful and useful tool for the Linux kernel observability, security and networking. eBPF programs are attached to events happening in the kernel such as system calls or tracepoints and transfer data through eBPF objects called maps. High performance events collection and investigation relies heavily on an eBPF map called ring buffer, a pointer-based communication channel optimized for data transfer. However the kernel and the user space rely on shared-memory synchronized pointers to govern the buffer’s layout, consistency and free space. This thesis studies the security and the architectural implications of this synchronization mechanism between concurrent kernel and the user space programs.
To formally analyze these mechanics, I used the Promela language alongside the SPIN model checker, abstracting the behavior of this shared buffer structure focusing on the eBPF-specific helper functions used specifically to interact with it
Relatori
Anno Accademico
Tipo di pubblicazione
Numero di pagine
Corso di laurea
Classe di laurea
Aziende collaboratrici
URI
![]() |
Modifica (riservato agli operatori) |
