• Corpus ID: 1243224

Quasi-friendly sup-interpretations

@article{Marion2006QuasifriendlyS,
  title={Quasi-friendly sup-interpretations},
  author={Jean-Yves Marion and Romain P{\'e}choux},
  journal={ArXiv},
  year={2006},
  volume={abs/cs/0608020}
}
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… 
2 Citations

Figures from this paper

Automated Implicit Computational Complexity Analysis
TLDR
This paper describes a (command-line based) system that implements the majority of known techniques from term rewriting and compares their relative strength, and presents experimental findings to simplify comparisons.
Automated Implicit Computational Complexity Analysis (System Description)
TLDR
A fully automatic and command-line based system that implements the majority of term rewriting techniques for polynomial time computable functions is described and experimental findings are presented to simplify comparisons.

References

SHOWING 1-10 OF 18 REFERENCES
Resource Analysis by Sup-interpretation
TLDR
The notion of sup-interpretation which bounds from above the size of function outputs is introduced, which applies to first order functional programming with pattern matching and establishes a criteria for which the stack frame size is polynomially bounded.
Quasi-interpretation: a way to control ressources
TLDR
A method to determine if a program admits or not a quasi-interpretation in a broad class which is relevant for feasible computations is proposed, and several characterizations of complexity classes starting from Ptime and Pspace are obtained.
Max-Plus Quasi-interpretations
TLDR
It is proved that the synthesis of quasi-interpretations selected in the space of polynomials over the max-plus algebra determined by the non-negative rationals extended with −∞ and equipped with binary operations for the maximum and the addition is NP-hard.
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
A Type System for Bounded Space and Functional In-Place Update
TLDR
It is shown how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place and a resource type ⋄ is introduced which controls the number of constructor symbols such as cons in recursive definitions and ensures linear space while restricting expressive power surprisingly little.
The size-change principle for program termination
TLDR
This work establishes the problem's intrinsic complexity, and gives a direct algorithm operating on "size-change graphs" (without the passage to automata), which turns out to be surprisingly high, complete for PSPACE, in spite of the simplicity of the principle.
Computability and complexity - from a programming perspective
  • N. Jones
  • Computer Science
    Foundations of computing series
  • 1997
TLDR
These notes contain some high points from the recent book, emphasising what is different or novel with respect to more traditional treatments of computability and complexity theory, and some new results as well.
Heap-Bounded Assembly Language
We present a first-order linearly typed assembly language, HBAL, that allows the safe reuse of heap space for elements of different types. Linear typing ensures the single pointer property,
Resource Control for Synchronous Cooperative Threads
TLDR
A suitable control flow analysis is presented that allows to formulte the static analyses for resource control at byte code level and shows that these two methods can be combined to obtain an explicit polynomial bound on the resources needed for the execution of the system during an instant.
On Lexicographic Termination Ordering with Space Bound Certifications
TLDR
It is demonstrated that the class of functions computed by first order functional programs over free algebras which terminate by Lexicographic Path Ordering and admit a polynomial quasi-interpretation, is exactly theclass of functions computable inPolynomial space.
...
1
2
...