Proving program termination (Part 3)
- π€ Speaker: Byron Cook, Microsoft Research, Cambridge
- π Date & Time: Monday 22 October 2007, 10:00 - 12:00
- π Venue: Computer Laboratory, William Gates Building, Room FW11
Abstract
This course will survey both old and recently discovered techniques for proving that programs terminate.
This course is made of three parts.
Byronβs started putting some of the slides at http://www.foment.net/byron/ .
Series This talk is part of the Mini Courses in Theoretical Computer Science series.
Included in Lists
- All Talks (aka the CURE list)
- All transferable skills in the university: computing
- bld31
- Cambridge talks
- Computer Laboratory, William Gates Building, Room FW11
- Department of Computer Science and Technology talks and seminars
- Interested Talks
- Mini Courses in Theoretical Computer Science
- Modelling Biology
- School of Technology
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Byron Cook, Microsoft Research, Cambridge
Monday 22 October 2007, 10:00-12:00