Tue 9 Jan 2018 10:19 - 10:21 at Bradbury - POSTER SESSION (14 posters - not talks)

We study the problem of deciding program equivalence in the context of Probabilistic NetKAT, a formal language for reasoning about the behavior of packet-switched networks. We show that the problem is decidable for the history-free fragment of the language, and discuss a path toward a decision procedure for the full language. The main challenge lies in reasoning about iteration, which we address by a reduction to finite-state absorbing Markov chains. We also describe an OCaml prototype that we have used to reason about probabilistic network programs.

poster (poster.pdf)969KiB
extended-abstract (pps-extended-abstract.pdf)552KiB

Tue 9 Jan

pps-2018
10:00 - 10:30: PPS 2018 - POSTER SESSION (14 posters - not talks) at Bradbury
pps-2018151548840000010:00 - 10:02
Talk
pps-2018151548852900010:02 - 10:04
Talk
pps-2018151548865700010:04 - 10:06
Talk
Pre-print
pps-2018151548878600010:06 - 10:08
Talk
pps-2018151548891400010:08 - 10:10
Talk
pps-2018151548904300010:10 - 10:12
Talk
pps-2018151548917100010:12 - 10:15
Talk
Link to publication Pre-print
pps-2018151548930000010:15 - 10:17
Talk
Pre-print
pps-2018151548942900010:17 - 10:19
Talk
pps-2018151548955700010:19 - 10:21
Talk
Link to publication File Attached
pps-2018151548968600010:21 - 10:23
Talk
pps-2018151548981400010:23 - 10:25
Talk
pps-2018151548994300010:25 - 10:27
Talk
pps-2018151549007100010:27 - 10:30
Talk