Resource Analysis by Sup-interpretation

We propose a new method to control memory resources by static analysis. For this, we introduce the notion of sup-interpretation which bounds from above the size of function outputs. We establish a criteria for which the stack frame size is polynomially bounded. The criteria analyses terminating as well as non-terminating programs. This method applies to first order functional programming with pattern matching. This work is related to quasi-interpretations but we are now able to determine resources of different algorithms and it is easier to perform an analysis with this new tools.

• Type: Conference
• Year: 2006
• Where: FLOPS
• Authors: Jean-Yves Marion, Romain Péchoux
• Keywords: Automated Reasoning, FLOPS 2006, Function Outputs, Stack Frame Size, Static Analysis