Efficient incremental run-time specialization for free (1999) [44 citations — 4 self]
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Marlet99efficientincremental,author = {Renaud Marlet and Charles Consel},
title = {Efficient incremental run-time specialization for free},
booktitle = {In Proceedings of the ACM SIGPLAN '99 Conference on Programming Language Design and Implementation},
year = {1999},
pages = {281--292}
}
Years of Citing Articles
Abstract:
Availability of data in a program determines computation stages. Incremental partial evaluation exploit these stages for optimization: it allows further specialization to be performed as data become available at later stages. The fundamental advantage of incremental specialization is to factorize the specialization process. As a result, specializing a program at a given stage costs considerably less than specializing it once all the data are available. We present a realistic and flexible approach to achieve efficient incremental run-time specialization. Rather than developing specific techniques, as previously proposed, we are able to re-use existing technology by iterating a specialization process. Moreover, in doing so, we do not lose any specialization opportunities. This approach makes it possible to exploit nested quasi-invariants and to speed up the run-time specialization process. Our approach has been implemented in Tempo, a specializer for C programs that is publicly available. A preliminary experiment confirms that incremental specialization can greatly speed up the specialization process.
Citations
| 44 | A toolkit for constructing type- and constraint-based program analyses – Aiken, Fahndrich, et al. - 1998 |
