activity
20182020
most citedScalable Verification of Probabilistic Networks

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

collaborators

5 papers

cs.PL2020

Petr4: Formal Foundations for P4 Data Planes

Ryan Doenges, Mina Tahmasbi Arashloo, Santiago Bautista +7

P4 is a domain-specific language for programming and specifying packet-processing systems. It is based on an elegant design with high-level abstractions like parsers and match-acti…

cs.PL2019

TxForest: A DSL for Concurrent Filestores

Jonathan DiLorenzo, Katie Mancini, Kathleen Fisher +1

Many systems use ad hoc collections of files and directories to store persistent data. For consumers of this data, the process of properly parsing, using, and updating these filest…

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.PL201923 cited

Scalable Verification of Probabilistic Networks

Steffen Smolka, Praveen Kumar, David M Kahn +4

This paper presents McNetKAT, a scalable tool for verifying probabilistic network programs. McNetKAT is based on a new semantics for the guarded and history-free fragment of Probab…

cs.DC2018

NetChain: Scale-Free Sub-RTT Coordination (Extended Version)

Xin Jin, Xiaozhou Li, Haoyu Zhang +5

Coordination services are a fundamental building block of modern cloud systems, providing critical functionalities like configuration management and distributed locking. The major…