## Symbolic polynomial maximization over convex sets and its application to memory requirement estimation (2006)

Citations: | 8 - 5 self |

### BibTeX

@TECHREPORT{Clauss06symbolicpolynomial,

author = {Philippe Clauss and Université Louis Pasteur and Federico Javier Fernández and Diego Garbervetsky},

title = {Symbolic polynomial maximization over convex sets and its application to memory requirement estimation},

institution = {},

year = {2006}

}

### OpenURL

### Abstract

Memory requirement estimation is an important issue in the development of embedded systems, since memory directly influences performance, cost and power consumption. So it is crucial to have tools that automatically compute accurate estimates of the memory requirements of programs to better control the development process and avoid some catastrophic execution exceptions. In this paper, we propose an original approach based on the theory of Bernstein expansion allowing the resolution of many important memory issues that are expressed as the problem of maximizing a parametric polynomial defined over a parametric convex domain. The paper is illustrated with several application examples.