Caching Intermediate Results for Program Improvement (1995)
Cached
Download Links
- [ftp.cs.indiana.edu]
- [ftp.cs.cornell.edu]
- [www.grammatech.com]
- [www.grammatech.com]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation |
| Citations: | 19 - 6 self |
BibTeX
@INPROCEEDINGS{Liu95cachingintermediate,
author = {Yanhong Liu and Tim Teitelbaum},
title = {Caching Intermediate Results for Program Improvement},
booktitle = {In Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation},
year = {1995},
pages = {190--201},
publisher = {ACM}
}
Years of Citing Articles
OpenURL
Abstract
A systematic approach is given for symbolically caching intermediate results useful for deriving incremental programs from non-incremental programs. We exploit a number of program analysis and transformation techniques, centered around effective caching based on its utilization in deriving incremental programs, in order to increase the degree of incrementality not otherwise achievable by using only the return values of programs that are of direct interest. Our method can be applied straightforwardly to provide a systematic approach to program improvement via caching. 1 Introduction Incremental programs take advantage of repeated computations on inputs that differ only slightly from one another, making use of the old output in computing a new output rather than computing from scratch. Methods of incremental computation have widespread application, e.g., optimizing compilers [2, 9, 11], transformational programming [29, 32, 42], interactive editing systems [4, 38], etc. In this paper, ...







