Synthesis of Quasi-interpretations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2005

Synthesis of Quasi-interpretations


This paper presents complexity results by showing that the synthesis of MaxPoly quasi-interpretations over reals is decidable in exponential time with fixed polynomial degrees and fixed max-degree and that the synthesis ofMaxPlus quasi-interpretations over reals is NPtime-complete with fixed multiplicative degrees and fixed max-degree. Quasi-interpretations are a tool that allows to control resources like the runtime, the runspace or the size of a result in a program execution. Quasi-interpretations assign to each program symbol a numerical function which is compatible with the computational semantics and roughly speaking provide an upper bound on sizes of intermediate values computed.
Fichier principal
Vignette du fichier
LCC05.pdf (183.66 Ko) Télécharger le fichier

Dates and versions

inria-00000660 , version 1 (10-11-2005)


  • HAL Id : inria-00000660 , version 1


Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen, Romain Péchoux. Synthesis of Quasi-interpretations. Seventh International Workshop on Logic and Computational Complexity - LCC 2005, Jun 2005, Chicago/USA. ⟨inria-00000660⟩
140 View
186 Download


Gmail Facebook Twitter LinkedIn More