Partial Evaluation as a primitive in modern network troubleshooting (Talk Proposal)
summary
Partial evaluation compresses real network instances into a smaller residual network by compiling away SDN for-log conditions, BGP path computation, or INC concurrency models; a hand‑coded partial evaluator over a Prolog meta-interpreter unfolds conditions for a small SDN example with four failure scenarios, produces a residual program and a debugging session that locates the buggy policy, and demonstrably works; a proposed dual partial evaluation maps residual diagnoses back to original topology and remains the main open challenge.
AI-written summary · about
chapters (9)
- 0:00Partial evaluation in networking
- 1:07Generalizing troubleshooting
- 3:56Simplifying SDN
- 7:04Debugging SDN
- 10:38Partial evaluation for BGP
- 13:08Compressing BGP networks
- 15:13Concurrency and failure in INC
- 17:02Summary and challenges
- 17:22Q&A on attacks
related talks
26mEnhancing network diagnosis with reflection in Prolog (extended abstract)
20mContra: A Programmable System for Performance aware Routing
47mDeep Programmability: A New Lens on Networking
01h 01mNetwork Verification: Past, Present, and Future
01h 08mThe Network is the Computer: A Programming Language Perspective
27mNetComplete: Practical Network-Wide Configuration Synthesis with Autocompletion
25mDataplane equivalence and its applications
17mPerformance Interfaces for Network Functions