BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Connecting Partial and Total Correctness for Probabilistic Program
 s in HOL4 - Aaron Coble (University of Cambridge)
DTSTART:20070605T120000Z
DTEND:20070605T130000Z
UID:TALK7414@talks.cam.ac.uk
CONTACT:Thomas Tuerk
DESCRIPTION:The paradigm of proving partial correctness and termination se
 parately in order to prove total correctness is widely used for proving pr
 operties of programs involving only demonic or angelic\nnondeterminism. A 
 similar approach can be taken when proving properties of programs involvin
 g both demonic and probabilistic nondeterminism. This short talk will focu
 s on work in progress proving a connection between partial and total corre
 ctness for an\nimplementation of the probabilistic-Guarded Command Languag
 e (pGCL) in HOL4.
LOCATION:Computer Laboratory\, William Gates Building\, Room GS15
END:VEVENT
END:VCALENDAR