Optimized Live Heap Bound Analysis

Abstract

This paper describes a general approach for optimized live heap space and live heap space-bound analyses for garbage-collected languages. The approach is based on program analysis and transformations and is fully automatic. In our experience, the space-bound analysis generally produces accurate (tight) upper bounds in the presence of partially known input structures. The optimization drastically improve the analysis efficiency. The analyses have been implemented and experimental results confirm their accuracy and efficiency.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2003
Accession Number
ADA526412

Entities

People

  • Leena Unnikrishnan
  • Scott D. Stoller
  • Yanhong A. Liu

Organizations

  • Stony Brook University

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Binomials
  • Coefficients
  • Computations
  • Computer Programming
  • Computer Programs
  • Computer Science
  • Computers
  • Construction
  • Embedded Systems
  • High Level Languages
  • Language
  • Optimization
  • Polynomials
  • Programming Languages
  • Trees (Data Structures)

Fields of Study

  • Computer science

Readers

  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Parallel and Distributed Computing.

Technology Areas

  • Space