Automatic accurate live memory analysis for garbage-collected languages

被引：2

作者：

Unnikrishnaw, L ^{[1
]}

Stoller, SD ^{[1
]}

Liu, YHA ^{[1
]}

机构：

[1] SUNY Stony Brook, Dept Comp Sci, Stony Brook, NY 11794 USA

来源：

ACM SIGPLAN NOTICES | 2001年 / 36卷 / 08期

关键词：

D O I：

10.1145/384196.384212

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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.

引用

页码：102 / 111

页数：10

共 29 条

[1]

Altenbernd P., 1996, Proceedings of the Eighth Euromicro Workshop on Real-Time Systems, P102, DOI 10.1109/EMWRTS.1996.557827

[2]

Cormen T. H., 1990, INTRO ALGORITHMS

[3] AUTOMATIC AVERAGE-CASE ANALYSIS OF ALGORITHMS [J].

FLAJOLET, P ;

SALVY, B ;

ZIMMERMANN, P .

THEORETICAL COMPUTER SCIENCE, 1991, 79 (01) :37-109

[4] Cache Miss Equations: A compiler framework for analyzing and tuning memory behavior [J].

Ghosh, S ;

Martonosi, M ;

Malik, S .

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1999, 21 (04) :703-746

[5]

HENRIKSSON R, 1998, THESIS LUND U

[6]

HUGHES J, 1996, 23 ANN ACM S PRINC P, P410

[7] ANALYSIS OF FUNCTIONAL PROGRAMS TO DETECT RUN-TIME GARBAGE CELLS [J].

INOUE, K ;

SEKI, H ;

YAGI, H .

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1988, 10 (04) :555-578

[8]

JENSEN TP, 1990, LECT NOTES COMPUT SC, V432, P227

[9]

Knuth D. E., 1968, The Art of Computer Programming, Volume I: Fundamental Algorithms, VI

[10] ACE - AN AUTOMATIC COMPLEXITY EVALUATOR [J].

LEMETAYER, D .

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1988, 10 (02) :248-266

← 1 2 3 →