BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Well-quasi-orderings for progam analysis and computational complex
 tiy - Schnoebelen \, P (CNRS (Centre national de la recherche scientifique
 ))
DTSTART:20151216T100000Z
DTEND:20151216T110000Z
UID:TALK62918@talks.cam.ac.uk
CONTACT:42080
DESCRIPTION:Co-author: Sylvain Schmitz (ENS Cachan)\n\nThe talk will surve
 y some of the applications of well-quasi-orderings in computer science.\nW
 ell-quasi-orderings are an important tool in some areas like program verif
 ication\, or computer-aided deduction and theorem-proving. Most importantl
 y\, they provide easy proofs for the decidability of logical or combinator
 ial problems. Recent work by the authors aim at extracting computational c
 omplexity bounds from decidability proofs that rely on well-quasi-ordering
 s.\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR