Automatic Accurate Live Memory Analysis for Garbage-Collected Languages

Authors:
Leena Unnikrishnan;Scott D. Stoller;Yanhong A. Liu
Affiliations:
Computer Science Department, SUNY at Stony Brook, Stony Brook, NY;Computer Science Department, SUNY at Stony Brook, Stony Brook, NY;Computer Science Department, SUNY at Stony Brook, Stony Brook, NY
Venue:
OM '01 Proceedings of the 2001 ACM SIGPLAN workshop on Optimization of middleware and distributed systems
Year:
2001

Citing 23
Cited 8

ACE: an automatic complexity evaluator

ACM Transactions on Programming Languages and Systems (TOPLAS)
Analysis of functional programs to detect run-time garbage cells

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

Introduction to algorithms
A backwards analysis for compile-time garbage collection

Proceedings of the third European symposium on programming on ESOP '90
Complexity analysis for a lazy higher-order language

Proceedings of the third European symposium on programming on ESOP '90
Proceedings of the fourth international conference on Functional programming languages and computer architecture

FPCA89 The International Conference on Functional Programming Languages & Computer Architectures
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
Garbage collection: algorithms for automatic dynamic memory management

Garbage collection: algorithms for automatic dynamic memory management
Proving the correctness of reactive systems using sized types

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Proceedings of the ACM SIGPLAN 1999 workshop on Languages, compilers, and tools for embedded systems

Workshop on Languages, Compilers, and Tools for Embedded Systems(Part of FCRC, PLDI'99)
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
Automatic Accurate Time-Bound Analysis for High-Level Languages

LCTES '98 Proceedings of the ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Embedded Systems
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

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
Dynamic Programming via Static Incrementalization

Higher-Order and Symbolic Computation
Optimized Live Heap Bound Analysis

VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Performance analysis based upon complete profiles

Proceedings of the 2006 conference on Specification and verification of component-based systems
Live heap space analysis for languages with garbage collection

Proceedings of the 2009 international symposium on Memory management
Type-Based amortised heap-space analysis

ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
Space overhead bounds for dynamic memory management with partial compaction

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a general approach for automatic and accurate live heap space and live heap space-bound analyses for high-level languages. The approach is based on program analysis and transformations and is fully automatic. The space-bound analysis produces accurate (tight) upper bounds in the presence of partially known input structures. The analyses have been implemented and experimental results confirm their accuracy.