On complexity analysis by quasi-interpretation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2004

On complexity analysis by quasi-interpretation


We present a survey on a method to analyse the program time and space complexity, based on termination orderings and quasi-interpretation. This method can be implemented to certify the runtime (or space) of programs. We demonstrate that the class of functions computed by first order functional programs over free algebras which terminate by permutation Path Ordering (resp. Lexicographic Path Ordering) and admit a quasi-interpretation bounded by a polynomial, is exactly the class of functions computable in polynomial time (resp. space).
Not file

Dates and versions

inria-00100099 , version 1 (26-09-2006)


  • HAL Id : inria-00100099 , version 1


Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen. On complexity analysis by quasi-interpretation. 2nd Appsem II workshop - APPSEM'04, 2004, Tallinn, Estonia, pp.85-95. ⟨inria-00100099⟩
55 View
0 Download


Gmail Facebook Twitter LinkedIn More