%0 Journal Article
%J Annals of Pure and Applied Logic
%D 2016
%T Reverse mathematical bounds for the Termination Theorem
%A Silvia Steila
%A Keita Yokoyama
%X Abstract In 2004 Podelski and Rybalchenko expressed the termination of transition-based programs as a property of well-founded relations. The classical proof by Podelski and Rybalchenko requires Ramsey's Theorem for pairs which is a purely classical result, therefore extracting bounds from the original proof is non-trivial task. Our goal is to investigate the termination analysis from the point of view of Reverse Mathematics. By studying the strength of Podelski and Rybalchenko's Termination Theorem we can extract some information about termination bounds.
%B Annals of Pure and Applied Logic
%G eng
%U http://www.iam.unibe.ch/ltgpub/2016/styo16.pdf
%R 10.1016/j.apal.2016.06.001