BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Proving recursive programs terminating - Dr Byron Cook (Microsoft 
 Research)
DTSTART:20081104T130000Z
DTEND:20081104T140000Z
UID:TALK13423@talks.cam.ac.uk
CONTACT:Thomas Tuerk
DESCRIPTION:This talk will show that termination proving for recursive pro
 grams can be divided into two parts: the analysis of recursive programs fo
 r safety properties\, and termination proving for non-recursive programs. 
  We then show how existing tools (e.g. RHS for the analysis of recursive p
 rograms\, and the TERMINATOR termination prover) can be combined into a po
 werful new termination prover for recursive procedures.
LOCATION:Computer Laboratory\, William Gates Building\, Room SS03
END:VEVENT
END:VCALENDAR