![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Tuesday 05 June 2007, 13:00-14:00
Connecting Partial and Total Correctness for Probabilistic Programs in HOL4
- đ¤ Speaker: Aaron Coble (University of Cambridge)
- đ Date & Time: Tuesday 05 June 2007, 13:00 - 14:00
- đ Venue: Computer Laboratory, William Gates Building, Room GS15
Questions? Contact
Thomas Tuerk
Abstract
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 .
Series This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Computer Laboratory Automated Reasoning Group Lunches
- Computer Laboratory, William Gates Building, Room GS15
- Department of Computer Science and Technology talks and seminars
- Interested Talks
- Martin's interesting talks
- School of Technology
- Trust & Technology Initiative - interesting events
- yk373's list
- yk449
Note: Ex-directory lists are not shown.