BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260723T082044Z
UID:Seminar-dept-1067@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20231010T130000
DTEND:20231010T140000
SUMMARY:School Seminar Series
DESCRIPTION:Dr. George Kenison: (Un)Solvable Loop Analysis\n\nLoop invariants are program properties that hold both before and after every loop iteration.  On the one hand, automatically synthesising polynomial loop invariants in the restricted setting of single-path loops with linear updates is computable. On the other hand, synthesising polynomial invariants for loops with polynomial updates (so called polynomial loops) is an open problem.\n\n\n\nIn this talk we review established algebraic techniques for automatically computing polynomial invariants for a class of single-path polynomial loops (so called solvable loops).  We will then demonstrate a new technique for synthesising invariants for polynomial loops that are not solvable (so called unsolvable loops).\n\n\n\n This is joint work with: Daneshvar Amrollahi, Ezio Bartocci, Laura Kovács, Marcel Moosbrugger, and Miroslav Stankovič.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=1067
LOCATION:Ashton Lecture Theatre
END:VEVENT
END:VCALENDAR