Certified Memory Usage Analysis

Cachera, David; Jensen, Thomas; Pichardie, David; Schneider, Gerardo

doi:10.1007/11526841_8

Cited by 26 publications

(23 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Also, the resource which has been studied in more depth is heap consumption, since applications to be deployed on devices with a limited amount of memory, such as smartcards, must be rejected if they require more memory than that available. Another related work is [6], where a resource usage analysis is presented. Again, this work focuses on memory consumption and it aims at verifying that the program executes in bounded memory by making sure that the program does not create new objects inside loops.…”

Section: Discussionmentioning

confidence: 99%

Cost Analysis of Java Bytecode

Albert

Arenas

Genaim

et al. 2007

Programming Languages and Systems

118

201

View full text Add to dashboard Cite

Abstract. Cost analysis of Java bytecode is complicated by its unstructured control flow, the use of an operand stack and its object-oriented programming features (like dynamic dispatching). This paper addresses these problems and develops a generic framework for the automatic cost analysis of sequential Java bytecode. Our method generates cost relations which define at compile-time the cost of programs as a function of their input data size. To the best of our knowledge, this is the first approach to the automatic cost analysis of Java bytecode.

show abstract

Section: Discussionmentioning

confidence: 99%

Cost Analysis of Java Bytecode

Albert

Arenas

Genaim

et al. 2007

Programming Languages and Systems

118

201

View full text Add to dashboard Cite

show abstract

“…Furthermore, heap space was not considered. More recently, Cachera et al [11] proposed constraint-based memory analysis for a Java-based bytecode language. For a given program, their loop-detecting algorithm can find methods and instructions that execute for an unbounded number of times.…”

Section: Related Workmentioning

confidence: 99%

Analysing memory resource bounds for low-level programs

Chin

Nguyen

Popeea

et al. 2008

Proceedings of the 7th International Symposium on Memory Management

View full text Add to dashboard Cite

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.

show abstract

“…al. [6] proposed a constraint-based memory analysis for Java Bytecode-like languages. For a given program their loop-detecting algorithm can detect methods and instructions that execute an unbounded number of times, thus can be used to check whether the memory usage is bounded or not.…”

Section: Related Workmentioning

confidence: 99%

Memory Usage Verification for OO Programs

et al. 2005

View full text Add to dashboard Cite

Abstract. We present a new type system for an object-oriented (OO) language that characterizes the sizes of data structures and the amount of heap memory required to successfully execute methods that operate on these data structures. Key components of this type system include type assertions that use symbolic Presburger arithmetic expressions to capture data structure sizes, the effect of methods on the data structures that they manipulate, and the amount of memory that methods allocate and deallocate. For each method, we conservatively capture the amount of memory required to execute the method as a function of the sizes of the method's inputs. The safety guarantee is that the method will never attempt to use more memory than its type expressions specify. We have implemented a type checker to verify memory usages of OO programs. Our experience is that the type system can precisely and effectively capture memory bounds for a wide range of programs.

show abstract

Certified Memory Usage Analysis

Cited by 26 publications

References 14 publications

Cost Analysis of Java Bytecode

Cost Analysis of Java Bytecode

Analysing memory resource bounds for low-level programs

Memory Usage Verification for OO Programs

Contact Info

Product

Resources

About