Scalable Verification of Probabilistic Networks

Steffen Smolka
Steffen Smolka
David M. Kahn
David M. Kahn

Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 190-203, 2019.

Cited by: 3|Bibtex|Views38|DOI:https://doi.org/10.1145/3314221.3314639
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|dl.acm.org|arxiv.org

Abstract:

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 Probabilistic NetKAT in terms of finite-state, absorbing Markov chains. This view allows the semantics of all programs to be computed exactly, enabling construction o...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments