Eliminating dead code on recursive data (1999)
Cached
Download Links
| Venue: | Science of Computer Programming |
| Citations: | 14 - 4 self |
BibTeX
@INPROCEEDINGS{Liu99eliminatingdead,
author = {Yanhong A. Liu and Scott D. Stoller},
title = {Eliminating dead code on recursive data},
booktitle = {Science of Computer Programming},
year = {1999},
pages = {211--231},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. This paper describes a general and powerful method for dead code analysis and elimination in the presence of recursive data constructions. We represent partially dead recursive data using liveness patterns based on general regular tree grammars extended with the notion of live and dead, and we formulate the analysis as computing liveness patterns at all program points based on program semantics. This analysis yields a most precise liveness pattern for the data at each program point, which is signi cantly more precise than results from previous methods. The analysis algorithm takes cubic time in terms of the size of the program in the worst case but is very e cient in practice, as shown by our prototype implementation. The analysis results are used to identify and eliminate dead code. The general framework for representing and analyzing properties of recursive data structures using general regular tree grammars applies to other analyses as well. 1
