Skip to Main content Skip to Navigation
New interface
Conference papers

Complexity Bounds for Ordinal-Based Termination

Sylvain Schmitz 1, 2 
1 DAHU - Verification in databases
LSV - Laboratoire Spécification et Vérification [Cachan], Inria Saclay - Ile de France
Abstract : ‘What more than its truth do we know if we have a proof of a theorem in a given formal system?’ We examine Kreisel’s question in the particular context of program termination proofs, with an eye to deriving complexity bounds on program running times. Our main tool for this are length function theorems, which provide complexity bounds on the use of well quasi orders. We illustrate how to prove such theorems in the simple yet until now untreated case of ordinals. We show how to apply this new theorem to derive complexity bounds on programs when they are proven to terminate thanks to a ranking function into some ordinal.
Document type :
Conference papers
Complete list of metadata
Contributor : Sylvain Schmitz Connect in order to contact the contributor
Submitted on : Wednesday, October 22, 2014 - 6:57:41 PM
Last modification on : Saturday, June 25, 2022 - 7:45:59 PM

Links full text



Sylvain Schmitz. Complexity Bounds for Ordinal-Based Termination. 8th International Workshop on Reachability Problems, Sep 2014, Oxford, United Kingdom. pp.1--19, ⟨10.1007/978-3-319-11439-2_1⟩. ⟨hal-01076701⟩



Record views