Bachelor thesis presentation (LTCS)

Short Title: 
Bachelor thesis presentation
Event Date(s): 
Thursday, 27. September 2018 - 10:15 to 11:00

Room A097, ExWi, Sidlerstrasse 5, 3012 Bern

Bruno Senti

Proving program termination

We present two methods for proving program termination. In both methods we map program's states to some special relation and aim to derive a contradiction under the assumption that the program does not terminate.
The methods differ in the choice of such relations. The first exploits lexicographical orderings, while the second method is based on a famous result in Graph Theory: the Ramsey’s Theorem.