Proving recursive programs terminating

Add to your list(s) Download to your calendar using vCal

• Dr Byron Cook (Microsoft Research)
• Tuesday 04 November 2008, 13:00-14:00
• Computer Laboratory, William Gates Building, Room SS03.

If you have a question about this talk, please contact Thomas Tuerk.

This talk will show that termination proving for recursive programs can be divided into two parts: the analysis of recursive programs for safety properties, and termination proving for non-recursive programs. We then show how existing tools (e.g. RHS for the analysis of recursive programs, and the TERMINATOR termination prover) can be combined into a powerful new termination prover for recursive procedures.

This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• 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
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• yk373's list

Note that ex-directory lists are not shown.