1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.PL2026
A Fast Quantitative Analyzer for NetKAT
Thomas Lu, Qiancheng Fu, Kevin Batz +5
When designing a network, engineers must navigate trade-offs (e.g., one topology offers more aggregate bandwidth, another lower latency or better resilience) that demand reasoning…
cs.LO2020
A Bunched Logic for Conditional Independence
Jialu Bao, Simon Docherty, Justin Hsu +1
Independence and conditional independence are fundamental concepts for reasoning about groups of random variables in probabilistic programs. Verification methods for independence a…
cs.PL2017★ 1 cited
Probabilistic Program Equivalence for NetKAT
Steffen Smolka, Praveen Kumar, Nate Foster +4
We tackle the problem of deciding whether two probabilistic programs are equivalent in Probabilistic NetKAT, a formal language for specifying and reasoning about the behavior of pa…