Complexity Analysis by Rewriting

  • Martin Avanzini
  • Georg Moser
Conference paper

DOI: 10.1007/978-3-540-78969-7_11

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4989)
Cite this paper as:
Avanzini M., Moser G. (2008) Complexity Analysis by Rewriting. In: Garrigue J., Hermenegildo M.V. (eds) Functional and Logic Programming. FLOPS 2008. Lecture Notes in Computer Science, vol 4989. Springer, Berlin, Heidelberg

Abstract

In this paper we introduce a restrictive version of the multiset path order, called polynomial path order. This recursive path order induces polynomial bounds on the maximal number of innermost rewrite steps. This result opens the way to automatically verify for a given program, written in an eager functional programming language, that the maximal number of evaluation steps starting from any function call is polynomial in the input size. To test the feasibility of our approach we have implemented this technique and compare its applicability to existing methods.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Martin Avanzini
    • 1
  • Georg Moser
    • 2
  1. 1.Master Program in Computer ScienceUniversity of InnsbruckAustria
  2. 2.Institute of Computer ScienceUniversity of InnsbruckAustria

Personalised recommendations