Joel Ouaknine(University of Oxford, Department of Computer Science, Oxford, hosted by Rupak Majumdar)
"Termination of Linear Programs: Advances and Challenges"
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.
|Time:||Thursday, 02.10.2014, 10:30 am|
|Place:||MPI-SWS Kaiserslautern, Paul Ehrlich Str. 26, room 111|
|Video:||Simultaneous video cast to MPI-SWS Saarbrücken, Campus E1 5, room 029|