activity
20172026
most citedDependently-Typed Data Plane Programming

15 citations · 23 across the 5 of their papers we have counts for

collaborators

6 papers

cs.PL2026★ 1 cited

Optimal Predicate Pushdown Synthesis

Robert Zhang, Eric Hayden Campbell, Dixin Tang +1

Predicate pushdown is a long-standing performance optimization that filters data as early as possible in a computational workflow. In modern data pipelines, this transformation is…

cs.OS2025

Vulcan: Instance-specialized, Verifiable Systems Heuristics Through LLM-driven Search

Rohit Dwivedula, Divyanshu Saxena, Sujay Yadalam +3

Systems resource management tasks rely primarily on hand-designed heuristics. However, growing hardware heterogeneity and workload diversity require heuristics specialized to parti…

cs.PL2022★ 15 cited

Dependently-Typed Data Plane Programming

Matthias Eichholz, Eric Hayden Campbell, Matthias Krebs +2

Programming languages like P4 enable specifying the behavior of network data planes in software. However, with increasingly powerful and complex applications running in the network…

cs.LO2021

Injecting Finiteness to Prove Completeness for Finite Linear Temporal Logic

Eric Campbell, Michael Greenberg

Temporal logics over finite traces are not the same as temporal logics over potentially infinite traces. Roşu first proved completeness for linear temporal logic on finite traces (…

cs.PL2019

How to Avoid Making a Billion-Dollar Mistake: Type-Safe Data Plane Programming with SafeP4

Matthias Eichholz, Eric Campbell, Nate Foster +2

The P4 programming language offers high-level, declarative abstractions that bring the flexibility of software to the domain of networking. Unfortunately, the main abstraction used…

cs.PL2017★ 7 cited

Kleene Algebra Modulo Theories

Michael Greenberg, Ryan Beckett, Eric Campbell

Kleene algebras with tests (KATs) offer sound, complete, and decidable equational reasoning about regularly structured programs. Interest in KATs has increased greatly since NetKAT…