Optimized Live Heap Bound Analysis

Authors:
Leena Unnikrishnan;Scott D. Stoller;Yanhong A. Liu
Affiliations:
-;-;-
Venue:
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Year:
2002

Citing 21
Cited 10

ACE: an automatic complexity evaluator

ACM Transactions on Programming Languages and Systems (TOPLAS)
Introduction to algorithms

Introduction to algorithms
Compile-time garbage collection by sharing analysis

FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Automatic complexity analysis

FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Automatic average-case analysis of algorithms

Theoretical Computer Science - Theme issue on the algebraic and computing treatment of noncommutative power series
Predicting program execution times by analyzing static and dynamic program paths

Real-Time Systems - Special issue: Real-time languages and language-level timing tools and analysis
Effectiveness of trace sampling for performance debugging tools

SIGMETRICS '93 Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Proving the correctness of reactive systems using sized types

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Live memory analysis for garbage collection in embedded systems

Proceedings of the ACM SIGPLAN 1999 workshop on Languages, compilers, and tools for embedded systems
Issues and challenges in developing embedded software for information appliances and telecommunication terminals

Proceedings of the ACM SIGPLAN 1999 workshop on Languages, compilers, and tools for embedded systems
Recursion and dynamic data-structures in bounded space: towards embedded ML programming

Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Cache miss equations: a compiler framework for analyzing and tuning memory behavior

ACM Transactions on Programming Languages and Systems (TOPLAS)
Resource bound certification

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Calculating sized types

PEPM '00 Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Java without the coffee breaks: a nonintrusive multiprocessor garbage collector

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Automatic Accurate Live Memory Analysis for Garbage-Collected Languages

OM '01 Proceedings of the 2001 ACM SIGPLAN workshop on Optimization of middleware and distributed systems
Automatic time-bound analysis for a higher-order language

PEPM '02 Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Structure and Interpretation of Computer Programs

Structure and Interpretation of Computer Programs
Static prediction of heap space usage for first-order functional programs

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automatic Accurate Cost-Bound Analysis for High-Level Languages

IEEE Transactions on Computers
On Predicting Data Cache Behavior for Real-Time Systems

LCTES '98 Proceedings of the ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Embedded Systems

Heap space analysis for java bytecode

Proceedings of the 6th international symposium on Memory management
Parametric prediction of heap memory requirements

Proceedings of the 7th international symposium on Memory management
Live heap space analysis for languages with garbage collection

Proceedings of the 2009 international symposium on Memory management
Parametric heap usage analysis for functional programs

Proceedings of the 2009 international symposium on Memory management
A Type System for Usage of Software Components

Types for Proofs and Programs
Symbolic polynomial maximization over convex sets and its application to memory requirement estimation

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Live heap space bounds for real-time systems

APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Task-level analysis for a language with async/finish parallelism

Proceedings of the 2011 SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems
Automatic inference of resource consumption bounds

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
A type system for counting instances of software components

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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 improves the analysis efficiency. The analyses have been implemented and experimental results confirm their accuracy and efficiency.