University of Cambridge > Talks.cam > Computer Laboratory Automated Reasoning Group Lunches > Proving conditional termination

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

British Antarctic Survey CQIF Seminar

Other talks

Constructing the virtual fundamental cycle MOVED TO 28 JUNE 2018 It takes two to tango:platelet collagen receptor GPVI-dimer in thrombosis and clinical implications Not Maggie's fault? The Thatcher government and the reemergence of global finance Open as a Tool to Change Ecosystems Develop a tool for inferring symptoms from prescriptions histories for cancer patients TO A TRILLION AND BEYOND: THE FUTURE OF COMPUTING AND THE INTERNET OF THINGS - The IET Cambridge Prestige Lecture “Modulating Tregs in Cancer and Autoimmunity” Black and British Migration Picturing the Heart in 2020 Thermodynamics de-mystified? /Thermodynamics without Ansätze? ***PLEASE NOTE THIS SEMINAR IS CANCELLED*** Regulatory principles in human development and evolution
 

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