A Demand-Driven Set-Based Analysis (1997)
| Venue: | In Proceedings of the ACM Symposium on Principles of Programming Languages |
| Citations: | 13 - 1 self |
BibTeX
@INPROCEEDINGS{Biswas97ademand-driven,
author = {Sandip K. Biswas},
title = {A Demand-Driven Set-Based Analysis},
booktitle = {In Proceedings of the ACM Symposium on Principles of Programming Languages},
year = {1997},
pages = {372--385},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we present an analysis technique for isolating dead code in higher-order functional programs. First, we formalize what it means for a program fragment to contribute to the value returned by the program. Next, we provide a purely declarative specification of a subset of terms which constitute dead code. This is done by a refinement of the set-based semantics technique, developed by Nevin Heintze, by the introduction of a concept of demand. We then develop a demand-driven set-based analysis to compute dead code specified by the declarative specification. The demand-driven set-based analysis developed in this paper is polynomial time, in the size of the input program. 1 Introduction Elimination of dead code is a standard optimisation performed by modern compilers for imperative languages. But compilers for higher-order programming languages perform only extremely naive kinds of dead code elimination. The principal benefit associated with the elimination of dead code in fir...
