Skip to main content

Research Repository

Advanced Search

Analysing Memory Resource Bounds for Low-Level Programs

Chin, W.-N.; Nguyen, H.H.; Popeea, C.; Qin, S.

Authors

W.-N. Chin

H.H. Nguyen

C. Popeea

S. Qin



Abstract

Embedded systems are becoming more widely used but these systems are often resource constrained. Programming models for these systems should take into formal consideration resources such as stack and heap. In this paper, we show how memory resource bounds can be inferred for assembly-level programs. Our inference process captures the memory needs of each method in terms of the symbolic values of its parameters. For better precision, we infer path-sensitive information through a novel guarded expression format. Our current proposal relies on a Presburger solver to capture memory requirements symbolically, and to perform fixpoint analysis for loops and recursion. Apart from safety in memory adequacy, our proposal can provide estimate on memory costs for embedded devices and improve performance via fewer runtime checks against memory bound.

Citation

Chin, W., Nguyen, H., Popeea, C., & Qin, S. (2008). Analysing Memory Resource Bounds for Low-Level Programs. In 2008 International Symposium on Memory Management, ISMM’08, 7-8 June 2008, Tucson, AZ ; proceedings (151-160). https://doi.org/10.1145/1375634.1375656

Conference Name 7th International Symposium on Memory Management
Conference Location Tucson, Arizona
Start Date Jun 7, 2008
End Date Jun 8, 2008
Publication Date Jun 1, 2008
Deposit Date Nov 23, 2009
Publisher Association for Computing Machinery (ACM)
Pages 151-160
Book Title 2008 International Symposium on Memory Management, ISMM’08, 7-8 June 2008, Tucson, AZ ; proceedings.
DOI https://doi.org/10.1145/1375634.1375656

You might also like



Downloadable Citations