Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

IWMM

2007

Springer

2007

Springer

This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which deﬁne at compile-time the heap consumption of a program as a function of its data size. These relations can be used to obtain upper bounds on the heap space allocated during the execution of the different methods. In addition, we describe how to reﬁne the cost relations, by relying on escape analysis, in order to take into account the heap space that can be safely deallocated by the garbage collector upon exit from a corresponding method. These reﬁned cost relations are then used to infer upper bounds on the active heap space upon methods return. Example applications for the analysis consider inference of constant heap usage and heap usage proportional to the data size (including polynomial and exponential heap consumption). Our prototype implementation is reported and demonstrated by means of a series of examples which illustrate how the analysis na...

Related Content

Added |
08 Jun 2010 |

Updated |
08 Jun 2010 |

Type |
Conference |

Year |
2007 |

Where |
IWMM |

Authors |
Elvira Albert, Samir Genaim, Miguel Gómez-Zamalloa |

Comments (0)