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

Proving program termination (Part 3)

Add to your list(s) 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 .

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

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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