YoVDO

PfComp: A Verified Compiler for Packet Filtering Leveraging Binary Decision Diagrams

Offered By: ACM SIGPLAN via YouTube

Tags

Formal Verification Courses Network Security Courses OCaml Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a conference talk presenting PfComp, a verified compiler for stateless firewall policies that leverages binary decision diagrams. Discover how the compiler optimizes policies into an intermediate representation before generating efficient program code. Learn about the compiler's proof of correctness using the Coq proof assistant and its extraction into OCaml code. Gain insights into the promising experimental results, showcasing the compiler's ability to handle large firewall policies and generate code that outperforms sequential rule evaluation. Delve into the innovative approach of using binary decision diagrams for packet filtering and the implications for network security and performance.

Syllabus

[CPP'24] PfComp: A Verified Compiler for Packet Filtering Leveraging Binary Decision Diagr...


Taught by

ACM SIGPLAN

Related Courses

SPARK 2014
AdaCore via Independent
Automated Reasoning: Symbolic Model Checking
EIT Digital via Coursera
Software Testing and Verification
University System of Maryland via edX
Haskell for Imperative Programmers
YouTube
Model Checking and Temporal Logic - E. Allen Emerson's Turing Award Lecture
Association for Computing Machinery (ACM) via YouTube