University of Cambridge > Talks.cam > Mini Courses in Theoretical Computer Science > Proving program termination (Part 3)

Proving program termination (Part 3)

Download to your calendar using vCal

If you have a question about this talk, please contact Sam Staton .

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/ .

This talk is part of the Mini Courses in Theoretical Computer Science series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

ยฉ 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity