University of Cambridge > Talks.cam > Computer Laboratory Automated Reasoning Group Lunches > Proving conditional termination
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 describe a method of synthesizing reasonable underapproximations to weakest preconditions – a long standing open problem.
This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.
Note that ex-directory lists are not shown.
© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity