BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Cantor meets Scott: Domain-Theoretic Foundations for Probabilistic
  Network Programming - Alexandra Silva ( University College London)
DTSTART:20161202T140000Z
DTEND:20161202T150000Z
UID:TALK68429@talks.cam.ac.uk
CONTACT:Dominic Mulligan
DESCRIPTION:ProbNetKAT is a probabilistic extension of NetKAT with a denot
 ational semantics based on Markov kernels. The language is expressive enou
 gh to generate continuous distributions\, which raises the question of how
  to effectively compute in the language. This paper gives an alternative c
 haracterization of ProbNetKAT's semantics using domain theory\, which prov
 ides the foundations needed to build a practical implementation. The new s
 emantics demonstrates that it is possible to analyze ProbNetKAT programs p
 recisely using approximations of fixpoints and distributions with finite s
 upport. We develop an implementation and show how to solve a variety of pr
 actical problems including characterizing the expected performance of traf
 fic engineering schemes based on randomized routing and reasoning probabil
 istically about properties such as loop freedom.\n\nThis is joint work wit
 h Steffen Smolka\, Praveen Kumar\, Nate Foster\, and Dexter Kozen.
LOCATION:FW26
END:VEVENT
END:VCALENDAR