HOL4P4: mechanized small-step semantics for P4
summary
Claims a first complete P416 semantics that models extern-concurrency interactions and captures pipelines end-to-end, formalized in HOL4 with a heapless small-step semantics and a type system proving progress and preservation. Builds an import tool using Petra to turn real P4 into the formal model and derives a HOL4 executable semantics that is sound, runs test suites, and scales to real programs (examples verified up to about 10,000 lines).
AI-written summary · about
chapters (9)
- 0:00P4 and mechanized semantics
- 3:54HOL4P4 semantics design
- 7:46Architecture semantics
- 10:15Extern functions semantics
- 12:45Type system validation
- 14:11P4 program import tool
- 15:14Concurrency modeling
- 15:36Summary and related work
- 17:01Q&A
related talks
27mPetr4: Formal Foundations for P4 Data Planes
22mDependently-Typed Data Plane Programming
25mP4-SpecTec: A Language Mechanization Framework for P4
18mP4Cub: A Little Language for Big Routers
15mWhen P4 Meets Run-to-completion Architecture
19mP4R-Type: A Verified API for P4 Control Plane Programs
15mOn Temporal Verification of Stateful P4 Programs
01h 08mThe Network is the Computer: A Programming Language Perspective
