Analysing memory resource bounds for low-level programs

Wei-Ngan Chin, Huu Hai Nguyen, Corneliu Popeea, Shengchao Qin

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    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.
    Original languageEnglish
    Title of host publicationProceedings of the 7th international symposium on Memory management
    PublisherACM
    Pages151-160
    DOIs
    Publication statusPublished - 2008
    Event7th International Symposium on Memory Management - Tucson, United States
    Duration: 7 Jun 20088 Jun 2008
    Conference number: 7

    Conference

    Conference7th International Symposium on Memory Management
    Abbreviated titleISMM 2008
    CountryUnited States
    CityTucson
    Period7/06/088/06/08

    Fingerprint Dive into the research topics of 'Analysing memory resource bounds for low-level programs'. Together they form a unique fingerprint.

    Cite this