Eliminating dead code on recursive data

This paper describes a powerful method for dead-code analysis and elimination in the presence of recursive data constructions. We describe 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 anal...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Science of computer programming Ročník 47; číslo 2; s. 221 - 242
Hlavní autori: Liu, Yanhong A., Stoller, Scott D.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 01.05.2003
Predmet:
Constraints
Dead-code elimination
Program analysis
Recursive data structures
Regular-tree grammars
Slicing
Recursive data structures
Slicing
Regular-tree grammars
Constraints
Program analysis
Dead-code elimination
ISSN:0167-6423, 1872-7964
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper describes a powerful method for dead-code analysis and elimination in the presence of recursive data constructions. We describe 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 constraints constructed from the program and programming language semantics. The analysis yields the most precise program-based grammars that satisfy the constraints. The analysis algorithm takes cubic time in terms of the size of the program in the worst case but is very efficient in practice, as shown by our prototype implementation. The analysis results are used to identify and eliminate dead code. The framework for representing and analyzing properties of recursive data structures using general regular tree grammars applies to other analyses as well.
ISSN:0167-6423
1872-7964
DOI:10.1016/S0167-6423(02)00134-X