Sup-interpretations, a semantic method for static analysis of program resources - Archive ouverte HAL Access content directly
Journal Articles ACM Transactions on Computational Logic Year : 2009

Sup-interpretations, a semantic method for static analysis of program resources

(1) , (1)
1

Abstract

The sup-interpretation method is proposed as a new tool to control memory resources of first order functional programs with pattern matching by static analysis. It has beeen introduced in order to increase the intensionality, that is the number of captured algorithms, of a previous method, the quasi-interpretations. Basically, a sup-interpretation provides an upper bound on the size of function outputs. A criterion, which can be applied to terminating as well as non-terminating programs, is developed in order to bound the stack frame size polynomially. Since this work is related to quasi-interpretation, dependency pairs and size-change principle methods, we compare these notions obtaining several results. The first result is that, given any program, we have heuristics for nding a sup-interpretation when we consider polynomials of bounded degree. Another result consists in the characterizations of the sets of functions computable in polynomial time and in polynomial space. A last result consists in applications of sup-interpretations to the dependency pair and the size-change principle methods.
Fichier principal
Vignette du fichier
333pechoux.pdf (349.2 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00446057 , version 1 (11-01-2010)

Identifiers

Cite

Jean-Yves Marion, Romain Péchoux. Sup-interpretations, a semantic method for static analysis of program resources. ACM Transactions on Computational Logic, 2009, 10 (4), 30 p. ⟨10.1145/1555746.1555751⟩. ⟨inria-00446057⟩
97 View
137 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More