Making an eBPF Virtual Machine Faster on Microcontrollers: Verified Optimization and Proof Simplification - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2023

Making an eBPF Virtual Machine Faster on Microcontrollers: Verified Optimization and Proof Simplification

Abstract

As a revolutionary kernel extension technology, Berkeley Packet Filters (BPF) has been applied for various operating systems from different domains, from servers (Linux's extended BPF) to microcontrollers (RIOT-OS rBPF). Previous works have formally proved the memory isolation property for the non-optimized rBPF virtual machine in the Coq proof assistant. In this paper, we introduce a verified optimization for rBPF, and highlight a novel proof approach for optimization correctness: a simplification process is first used to transform monadic models with option state to simplified non-monadic models with inline arguments; then the optimization correctness theorem is split into i) proving simplification correct and ii) proving the optimization correctness on simplified models. Our proof approach enjoys a fruitful proof simplification. Preliminary experiments demonstrate satisfying performance.
Fichier principal
Vignette du fichier
setta23.pdf (792.97 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04376380 , version 1 (06-01-2024)

Licence

Identifiers

Cite

Shenghao Yuan, Benjamin Lion, Frédéric Besson, Jean-Pierre Talpin. Making an eBPF Virtual Machine Faster on Microcontrollers: Verified Optimization and Proof Simplification. SETTA 2023 - 9th International Symposium Dependable Software Engineering. Theories, Tools, and Applications, Nov 2023, Nanjing (Chine), China. pp.385-401, ⟨10.1007/978-981-99-8664-4_22⟩. ⟨hal-04376380⟩
20 View
17 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More