MPI-INF Logo
Campus Event Calendar

Event Entry

What and Who

Termination of Linear Programs: Advances and Challenges

Dr. Joel Ouaknine
University of Oxford
SWS Distinguished Lecture Series
AG 1, AG 2, AG 3, AG 4, AG 5, SWS, RG1, MMCI  
AG Audience
English

Date, Time and Location

Thursday, 2 October 2014
10:30
60 Minutes
G26
111
Kaiserslautern

Abstract

In the quest for program analysis and verification, program
termination -- determining whether a given program will always halt or
could execute forever -- has emerged as a central component. Although
proven undecidable in the general case by Alan Turing over 80 years ago,
positive results have been obtained in a variety of restricted instances.
We survey the situation with a focus on simple linear programs, i.e.,
WHILE loops in which all assignments and guards are linear, discussing
recent progress as well as ongoing and emerging challenges.

Contact

Vera Laubscher
--email hidden

Video Broadcast

Yes
Saarbrücken
E1 5
029
passcode not visible
logged in users only

Vera Laubscher, 09/22/2014 10:01 -- Created document.