Name
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1145/1375634.1375656 | ISMM |
Keywords | Field | DocType |
memory adequacy,assembly-level program,current proposal,memory resource bound,analysing memory resource bound,programming model,memory requirement,memory cost,low-level program,memory need,presburger solver,formal consideration resource,embedded system | Programming language,Programming paradigm,Computer science,Inference,Stack trace,Heap (data structure),Real-time computing,Theoretical computer science,Solver,Overlay,Flat memory model,Recursion | Conference |
Citations | PageRank | References |
31 | 1.44 | 20 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wei-Ngan Chin | 1 | 868 | 63.37 |
| Huu Hai Nguyen | 2 | 382 | 15.66 |
| Corneliu Popeea | 3 | 374 | 18.27 |
| Shengchao Qin | 4 | 711 | 62.81 |