Probabilistic Program Equivalence for NetKAT
arXiv: Programming Languages, 2017.
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 packet-switched networks. We show that the problem is decidable for the history-free fragment of the language by developing an effective decision procedure based ...More
Full Text (Upload PDF)
PPT (Upload PPT)