It is important to prove that supposedly terminating programs actually terminate, particularly
if those programs must be run on critical systems or downloaded into a client such as a …

The aim of this thesis is to provide an infrastructure for general recursive function definitions
in a proof assistant based on higher-order logic (HOL) that has no native support for …

Proving program termination is typically done by finding a well-founded ranking function for
the program states. Existing termination provers typically find ranking functions using either …

A size-change termination algorithm takes as input abstract information about a program in
the form of size-change graphs and uses it to determine whether any infinite computation …

Two directions of recent work on program termination use the concepts of size-change
termination resp. transition invariants. The difference in the setting has as consequence the …

Size-Change Termination (SCT) is a method of proving program termination based on the
impossibility of infinite descent. To this end we may use a program abstraction in which …

We describe a new approach to proving termination with size change graphs. This is the first
decision procedure for size change termination (SCT) which makes direct use of global …

This article considers an algorithmic problem related to the termination analysis of programs.
More specifically, we are given bounds on differences in sizes of data values before and …

Size-Change Termination (SCT) is a method of proving program termination based on the
impossibility of infinite descent. To this end we use a program abstraction in which …

In this article, we propose a unified framework for designing static analysers based on
program synthesis. For this purpose, we identify a fragment of second-order logic with …