Quasi-friendly sup-interpretations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

Quasi-friendly sup-interpretations


In a previous paper, the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static analysis. Basically, a sup-interpretation provides an upper bound on the size of function outputs. In this former work, a criterion, which can be applied to terminating as well as non-terminating programs, was developed in order to bound polynomially the stack frame size. In this paper, we suggest a new criterion which captures more algorithms computing values polynomially bounded in the size of the inputs. Since this work is related to quasi-interpretations, we compare the two notions obtaining two main features. The first one is that, given a program, we have heuristics for finding a sup-interpretation when we consider polynomials of bounded degree. The other one consists in the characterizations of the set of function computable in polynomial time and in polynomial space.
Fichier principal
Vignette du fichier
lcc2006.pdf (189.34 Ko) Télécharger le fichier

Dates and versions

inria-00110245 , version 1 (26-10-2006)


  • HAL Id : inria-00110245 , version 1


Jean-Yves Marion, Romain Péchoux. Quasi-friendly sup-interpretations. 8th International Workshop on Logic and Computational Complexity - LCC 2006 - LICS affiliated Workshop, James Royer, Aug 2006, Seattle/Etats-Unis. ⟨inria-00110245⟩
80 View
78 Download


Gmail Facebook Twitter LinkedIn More