Navigation
Recherche
|
[$] Verifying the BPF verifier's path-exploration logic
mardi 27 mai 2025, 21:15 , par LWN.net
Srinivas Narayana led a remote session about extending
Agni to prove the correctness of the BPF verifier's handling of different execution paths as part of the Linux Storage, Filesystem, Memory Management, and BPF Summit. The problem of ensuring the correctness of path exploration is much more difficult than the problem of ensuring the correctness of arithmetic operations (which was the subject of the previous session), however. Narayana's plan to tackle the problem makes use of a mixture of specialized techniques — and may need some assistance from the BPF developers to make it feasible at all.
https://lwn.net/Articles/1021825/
Voir aussi |
56 sources (32 en français)
Date Actuelle
dim. 1 juin - 22:26 CEST
|