University of Cambridge > > Computer Laboratory Automated Reasoning Group Lunches > Proving recursive programs terminating

Proving recursive programs terminating

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

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.

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