On the Computational Content of Termination Proofs

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9136)

Abstract

Given that a program has been shown to terminate using a particular proof, it is natural to ask what we can infer about its complexity. In this paper we outline a new approach to tackling this question in the context of term rewrite systems and recursive path orders. From an inductive proof that recursive path orders are well-founded, we extract an explicit realiser which bounds the derivational complexity of rewrite systems compatible with these orders. We demonstrate that by analysing our realiser we are able to derive, in a completely uniform manner, a number of results on the relationship between the strength of path orders and the bounds they induce on complexity.

References

  1. 1.
    Hofbauer, D.: Termination proofs by multiset path orderings imply primitive recursive derivation lengths. TCS 105, 129–140 (1992)MATHMathSciNetCrossRefGoogle Scholar
  2. 2.
    Weiermann, A.: Termination proofs for term rewriting systems with lexicographic path ordering imply multiply recursive derivation lengths. TCS 139, 355–362 (1995)MATHMathSciNetCrossRefGoogle Scholar
  3. 3.
    Buchholz, W.: Proof-theoretic analysis of termination proofs. APAL 75, 57–65 (1995)MATHMathSciNetGoogle Scholar
  4. 4.
    Parsons, C.: On a number theoretic choice schema and its relation to induction. In: Proceedings of the Intuitionism and Proof Theory, pp. 459–473 (1970)Google Scholar
  5. 5.
    Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)Google Scholar
  6. 6.
    Moser, G., Weiermann, A.: Relating derivation lengths with the slow-growing hierarchy directly. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 296–310. Springer, Heidelberg (2003) CrossRefGoogle Scholar
  7. 7.
    Cichon, E.A.: Termination orderings and complexity characterisations. In: Aczel, P., Simmons, H., Wainer, S.S. (eds.) Proof Theory, pp. 171–193. Cambridge University Press, Cambridge (1992)Google Scholar
  8. 8.
    Touzet, H.: Encoding the hydra battle as a rewrite system. In: Brim, L., Gruska, J., Zlatuška, J. (eds.) MFCS 1998. LNCS, vol. 1450, p. 267. Springer, Heidelberg (1998) CrossRefGoogle Scholar
  9. 9.
    Moser, G.: KBOs, ordinals, subrecursive hierarchies and all that. JLC (2015, to appear)Google Scholar
  10. 10.
    Figueira, D., Figueira, S., Schmitz, S., Schnoebelen, P.: Ackermannian and primitive-recursive bounds with dickson’s lemma. In: Proceedings of the 26th LICS, pp. 269–278. IEEE (2011)Google Scholar
  11. 11.
    Berardi, S., Oliva, P., Steila, S.: Proving termination with transition invariants of height \(\omega \). In: Proceedings of the 15th ICTCS, pp. 237–240 (2014)Google Scholar
  12. 12.
    Terese, : Term Rewriting Systems. Cambridge Tracks in Theoretical Computer Science. Cambridge University Press, Cambridge (2003)Google Scholar
  13. 13.
    Ferreira, M.C.F., Zantema, H.: Well-foundedness of term orderings. In: Lindenstrauss, N., Dershowitz, N. (eds.) CTRS 1994. LNCS, vol. 968, pp. 106–123. Springer, Heidelberg (1995) CrossRefGoogle Scholar
  14. 14.
    Goubault-Larrecq, J.: Well-founded recursive relations. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol. 2142, p. 484. Springer, Heidelberg (2001) CrossRefGoogle Scholar
  15. 15.
    Weiermann, A.: How is it that infinitary methods can be applied to finitary mathematics? Gödel’s T: a case study. JSL 63, 1348–1370 (1998)MATHMathSciNetGoogle Scholar
  16. 16.
    Arai, T.: Some results on cut-elimination, provable well-orderings, induction, and reflection. APAL 95, 93–184 (1998)MATHMathSciNetGoogle Scholar
  17. 17.
    Cichon, E.A., Weiermann, A.: Term rewriting theory for the primitive recursive functions. APAL 83, 199–223 (1997)MATHMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Institute of Computer ScienceUniversity of InnsbruckInnsbruckAustria

Personalised recommendations