University of Cambridge > Talks.cam > Computer Laboratory Automated Reasoning Group Lunches > Connecting Partial and Total Correctness for Probabilistic Programs in HOL4

Connecting Partial and Total Correctness for Probabilistic Programs in HOL4

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Thomas Tuerk.

The paradigm of proving partial correctness and termination separately in order to prove total correctness is widely used for proving properties of programs involving only demonic or angelic nondeterminism. A similar approach can be taken when proving properties of programs involving both demonic and probabilistic nondeterminism. This short talk will focus on work in progress proving a connection between partial and total correctness for an implementation of the probabilistic-Guarded Command Language (pGCL) in HOL4 .

This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity