BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Logic and Semantics Seminar (Computer Laboratory)
SUMMARY:Cantor meets Scott: Domain-Theoretic Foundations f
or Probabilistic Network Programming - Alexandra S
ilva ( University College London)
DTSTART;TZID=Europe/London:20161202T140000
DTEND;TZID=Europe/London:20161202T150000
UID:TALK68429AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/68429
DESCRIPTION:ProbNetKAT is a probabilistic extension of NetKAT
with a denotational semantics based on Markov kern
els. The language is expressive enough to generate
continuous distributions\, which raises the quest
ion of how to effectively compute in the language.
This paper gives an alternative characterization
of ProbNetKAT's semantics using domain theory\, wh
ich provides the foundations needed to build a pra
ctical implementation. The new semantics demonstra
tes that it is possible to analyze ProbNetKAT prog
rams precisely using approximations of fixpoints a
nd distributions with finite support. We develop a
n implementation and show how to solve a variety o
f practical problems including characterizing the
expected performance of traffic engineering scheme
s based on randomized routing and reasoning probab
ilistically about properties such as loop freedom.
\n\nThis is joint work with Steffen Smolka\, Prave
en Kumar\, Nate Foster\, and Dexter Kozen.
LOCATION:FW26
CONTACT:Dominic Mulligan
END:VEVENT
END:VCALENDAR