39 citations · 146 across the 23 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.LO2019★ 32 cited
Guarded Kleene Algebra with Tests: Verification of Uninterpreted Programs in Nearly Linear Time
Steffen Smolka, Nate Foster, Justin Hsu +3
Guarded Kleene Algebra with Tests (GKAT) is a variation on Kleene Algebra with Tests (KAT) that arises by restricting the union () and iteration () operations from KAT to pre…
cs.PL2019★ 23 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.LO2019
Semantics of higher-order probabilistic programs with conditioning
Fredrik Dahlqvist, Dexter Kozen
We present a denotational semantics for higher-order probabilistic programs in terms of linear operators between Banach spaces. Our semantics is rooted in the classical theory of B…