Detecting Empty Abstractions and Pruning Dead Paths in the Linux eBPF Verifier
Comments
Ranked by a public rubric, not by votes: what a comment adds counts, not who wrote it. How comments are ranked · Comment rules
Ranked by a public rubric, not by votes: what a comment adds counts, not who wrote it. How comments are ranked · Comment rules
Summary
A paper proposes a constant-time emptiness check for the Linux eBPF verifier's abstract domains (intervals plus tristate-number bitmasks) to detect and prune unreachable branches. Refining a register's state under an infeasible condition can yield contradictory domains whose intersection is empty, violating invariants that downstream operators assume and causing production outages…