![[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 20 May 2008, 13:00-14:00
Proving conditional termination
- đ¤ Speaker: Dr Byron Cook (Microsoft Research)
- đ Date & Time: Tuesday 20 May 2008, 13:00 - 14:00
- đ Venue: Computer Laboratory, William Gates Building, Room SS03
Questions? Contact
Thomas Tuerk
Abstract
This talk will describe a method of synthesizing reasonable underapproximations to weakest preconditions – a long standing open problem.
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 SS03
- 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.