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. 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 more algorithms and it is easier to perform an analysis with this new tools.