Establishing local temporal heap safety properties with applications to compile-time memory management

Ran Shaham, Eran Yahav, Elliot K. Kolodner, Mooly Sagiv

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

We present a framework for statically reasoning about temporal heap safety properties. We focus on local temporal heap safety properties, in which the verification process may be performed for a program object independently of other program objects. We apply our framework to produce new conservative static algorithms for compile-time memory management, which prove for certain program points that a memory object or a heap reference will not be needed further. These algorithms can be used for reducing space consumption of Java programs. We have implemented a prototype of our framework, and used it to verify compile-time memory management properties for several small, but interesting example programs, including JavaCard programs.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsRadhia Cousot
PublisherSpringer Verlag
Pages483-503
Number of pages21
ISBN (Print)3540403256, 9783540403258
DOIs
StatePublished - 2003

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2694
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Establishing local temporal heap safety properties with applications to compile-time memory management'. Together they form a unique fingerprint.

Cite this