Optimized live heap bound analysis

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

doi:10.1007/3-540-36384-x_9

Optimized live heap bound analysis

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

Computer Science

Stony Brook University

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

16 Scopus citations

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.

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Lenore D. Zuck, Paul C. Attie, Agostino Cortesi, Supratik Mukhopadhyay
Publisher	Springer Verlag
Pages	70-85
Number of pages	16
ISBN (Print)	9783540003489
DOIs	https://doi.org/10.1007/3-540-36384-x_9
State	Published - 2003

Publication series

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

Access to Document

10.1007/3-540-36384-x_9

Cite this

Unnikrishnan, L., Stoller, S. D., & Liu, Y. A. (2003). Optimized live heap bound analysis. In L. D. Zuck, P. C. Attie, A. Cortesi, & S. Mukhopadhyay (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 70-85). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2575). Springer Verlag. https://doi.org/10.1007/3-540-36384-x_9

Unnikrishnan, Leena ; Stoller, Scott D. ; Liu, Yanhong A. / Optimized live heap bound analysis. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Lenore D. Zuck ; Paul C. Attie ; Agostino Cortesi ; Supratik Mukhopadhyay. Springer Verlag, 2003. pp. 70-85 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{64d7f1190968427e8dcf021137af3aa1,

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

author = "Leena Unnikrishnan and Stoller, \{Scott D.\} and Liu, \{Yanhong A.\}",

year = "2003",

doi = "10.1007/3-540-36384-x\_9",

language = "English",

isbn = "9783540003489",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "70--85",

editor = "Zuck, \{Lenore D.\} and Attie, \{Paul C.\} and Agostino Cortesi and Supratik Mukhopadhyay",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

Unnikrishnan, L, Stoller, SD & Liu, YA 2003, Optimized live heap bound analysis. in LD Zuck, PC Attie, A Cortesi & S Mukhopadhyay (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2575, Springer Verlag, pp. 70-85. https://doi.org/10.1007/3-540-36384-x_9

Optimized live heap bound analysis. / Unnikrishnan, Leena; Stoller, Scott D.; Liu, Yanhong A.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Lenore D. Zuck; Paul C. Attie; Agostino Cortesi; Supratik Mukhopadhyay. Springer Verlag, 2003. p. 70-85 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2575).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - Optimized live heap bound analysis

AU - Unnikrishnan, Leena

AU - Stoller, Scott D.

AU - Liu, Yanhong A.

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/33746269839

U2 - 10.1007/3-540-36384-x_9

DO - 10.1007/3-540-36384-x_9

M3 - Chapter

AN - SCOPUS:33746269839

SN - 9783540003489

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 70

EP - 85

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A2 - Zuck, Lenore D.

A2 - Attie, Paul C.

A2 - Cortesi, Agostino

A2 - Mukhopadhyay, Supratik

PB - Springer Verlag

ER -

Unnikrishnan L, Stoller SD , Liu YA. Optimized live heap bound analysis. In Zuck LD, Attie PC, Cortesi A, Mukhopadhyay S, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2003. p. 70-85. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-36384-x_9

Optimized live heap bound analysis

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

Cite this