Mon 24 Jun 2019 14:00 - 14:20 at 224AB - Probabilistic Programming Chair(s): Martin Hirzel

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 of an automatic verification tool. Domain-specific
optimizations and a parallelizing backend enable
McNetKAT to analyze networks with thousands of nodes,
automatically reasoning about general properties such as probabilistic
program equivalence and refinement, as well as networking properties
such as resilience to failures. We evaluate McNetKAT's scalability
using real-world topologies, compare its performance against
state-of-the-art tools, and develop an extended case study on a
recently proposed data center network design.

Mon 24 Jun

pldi-2019-papers
14:00 - 15:30: PLDI Research Papers - Probabilistic Programming at 224AB
Chair(s): Martin HirzelIBM Research
pldi-2019-papers14:00 - 14:20
Talk
Steffen SmolkaCornell University, Praveen KumarCornell University, David M. KahnCarnegie Mellon University, USA, Nate FosterCornell University, Justin HsuUniversity of Wisconsin-Madison, USA, Dexter KozenCornell University, Alexandra SilvaUniversity College London
DOI Pre-print Media Attached
pldi-2019-papers14:20 - 14:40
Talk
Peixin WangShanghai Jiao Tong University, Hongfei FuIST Austria, Amir Kafshdar GoharshadyIST Austria, Krishnendu ChatterjeeIST Austria, Xudong QinEast China Normal University, China, Wenjun ShiEast China Normal University, China
Media Attached
pldi-2019-papers14:40 - 15:00
Talk
Marco Cusumano-TownerMIT-CSAIL, Feras SaadMassachusetts Institute of Technology, Alexander K. LewMassachusetts Institute of Technology, USA, Vikash MansingkhaMIT
Media Attached
pldi-2019-papers15:00 - 15:20
Talk
Jieyuan ZhangUNSW, Australia, Jingling XueUNSW Sydney
Media Attached