Static Caching for Incremental Computation

ACM Transactions on Programming Languages and Systems

Volumn 20, Issue 3, 1998, Pages 546-585

  Liu, Yanhong A ^a   Stoller, Scott D ^a   Teitelbaum, Tim ^b  

^a INDIANA UNIVERSITY   (United States)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

D.1 Programming Techniques : Automatic Programming automatic analysis of algorithms; program transformation; D.3.3 Programming Languages Language Constructs and Features; D.3.4 Programming Languages : Processors optimization

Indexed keywords

CACHING; INCREMENTAL PROGRAMS; MEMOIZATION;

CACHE MEMORY; COMPUTATION THEORY; COMPUTER AIDED DESIGN; COMPUTER PROGRAM LISTINGS; OPTIMIZATION; PROBLEM SOLVING; PROGRAM COMPILERS; SEMANTICS; ALGORITHMS; COMPUTATIONAL LINGUISTICS; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; PROGRAM TRANSLATORS;

COMPUTER PROGRAMMING; COMPUTER SOFTWARE;

CACHE AND PRUNE METHOD; PROGRAM TRANSFORMATIONS; STATIC CACHING;

EID: 0032057980     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/291889.291895     Document Type: Article

References (73)

1. ABADI, M., LAMPSON, B., AND LÉVY, J.-J. 1996. Analysis and caching of dependencies. In Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming. ACM, New York.
2. AHO, A. V., HOPCROFT, J. E., AND ULLMAN, J. D. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass.
3. AHO, A. V., SETHI, R., AND ULLMAN, J. D. 1986. Compilers, Principles, Techniques, and Tools. Addison-Wesley, Reading, Mass.
4. ALLEN, F. E. 1969. Program optimization. In Annual Review of Automatic Programming. Vol. 5. Pergamon Press, New York, 239-307.
5. ALLEN, F. E., COCKE, J., AND KENNEDY, K. 1981. Reduction of operator strength. In Program Flow Analysis, S. S. Muchnick and N. D. Jones, Eds. Prentice-Hall, Englewood Cliffs, N.J., 79-101.
6. BALLANCE, R. A., GRAHAM, S. L., AND VAN DE VANTER, M. L. 1992. The Pan language-based editing system. ACM Trans. Soft. Eng. Methodol. 1, 1 (Jan.), 95-127.
7. BIRD, R. S. 1980. Tabulation techniques for recursive programs. ACM Comput. Surv. 12, 4 (Dec.), 403-417.
8. BIRD, R. S. 1984. The promotion and accumulation strategies in transformational programming. ACM Trans. Program. Lang. Syst. 6, 4 (Oct.), 487-504.
9. BURSTALL, R. M. AND DARLINGTON, J. 1977. A transformation system for developing recursive programs. J. ACM 24, 1 (Jan.), 44-67.
10. CARTWRIGHT, R. 1984. Recursive programs as definitions in first order logic. SIAM J. Comput. 13, 2 (May), 374-408.
11. CHIN, W.-N. 1993. Towards an automated tupling strategy. In Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program manipulation. ACM, New York, 119-132.
12. CHIN, W.-N. AND KHOO, S.-C. 1993. Tupling functions with multiple recursion parameters. In Proceedings of the 3rd International Workshop on Static Analysis, P. Cousot, M. Falaschi, G. Filè, and A. Rauzy, Eds. Lecture Notes in Computer Science, vol. 724. Springer-Verlag, Berlin, 124-140.
13. COCKE, J. AND KENNEDY, K. 1977. An algorithm for reduction of operator strength. Commun. ACM 20, 11 (Nov.), 850-856.
14. COHEN, N. H. 1983. Eliminating redundant recursive calls. ACM Trans. Program. Lang. Syst. 5, 3 (July), 265-299.
15. CORMEN, T. H., LEISERSON, C. E., AND RIVEST, R. L. 1990. Introduction to Algorithms. The MIT Press/McGraw-Hill.
16. DERANSART, P., JOURDAN, M., AND LORHO, B. 1988. Attribute Grammars: Definitions, Systems, and Bibliography. Lecture Notes in Computer Science, vol. 323. Springer-Verlag, Berlin.
17. EARLEY, J. 1976. High level iterators and a method for automatically designing data structure representation. J. Comput. Lang. 1, 321-342.
18. GUNTER, C. A. 1992. Semantics of Programming Languages. The MIT Press, Cambridge, Mass.
19. HALL, R. J. 1990. Program improvement by automatic redistribution of intermediate results. Tech. Rep. AI-TR-1251, Artificial Intelligence Laboratory, MIT, Cambridge, Mass. Dec.
20. HALL, R. J. 1991. Program improvement by automatic redistribution of intermediate results: An overview. In Automating Software Design, M. R. Lowry and R. d. McCartney, Eds. AAAI Press/The MIT Press, 339-372.
21. HOOVER, R. 1992. Alphonse: Incremental computation as a programming abstraction. In Proceedings of the ACM SIGPLAN '92 Conference on Programming Language Design and Implementation. ACM, New York, 261-272.
22. HUGHES, J. 1985. Lazy memo-functions. In Proceedings of the 2nd Conference on Functional Programming Languages and Computer Architecture. Lecture Notes in Computer Science, vol. 201. Springer-Verlag, Berlin, 129-146.
23. HUGHES, J. 1990. Compile-time analysis of fuctional programs. In Research Topics in Functional Programming, D. Turner, Ed. Addison-Wesley, Reading, Mass., 117-153.
24. JONES, N. D., GOMARD, C. K., AND SESTOFT, P. 1993. Partial Evaluation and Automatic Program Generation. Prentice-Hall, Englewood Cliffs, N.J.
25. JONES, S. B. AND LE MÉTAYER, D. 1989. Compile-time garbage collection by sharing analysis. In Proceedings of the 4th International Conference on Functional Programming Languages and Computer Architecture. ACM, New York, 54-74.
26. KATAYAMA, T. 1984. Translation of attribute grammars into procedures. ACM Trans. Program. Lang. Syst. 6, 3 (July), 345-369.
27. KELLER, R. M. AND SLEEP, M. R. 1986. Applicative caching. ACM Trans. Program. Lang. Syst. 8, 1 (Jan.), 88-108.
28. KLEENE, S. C. 1952. Introduction to Metamathematics. Van Nostrand, New York. 10th reprint, Wolter-Noordhoff Publishing, Groningen and North-Holland Publishing Company, Amsterdam, 1991.
29. KNUTH, D. E. 1968. Semantics of context-free languages. Math. Syst. Theory 2, 2 (June), 127-145.
30. LAUNCHBURY, J. 1989. Projection factorisations in partial evaluation. Ph.D. thesis, Department of Computing, University of Glasgow, Glasgow, Scotland.
31. LAUNCHBURY, J. 1991. Strictness and binding-time analysis: Two for the price of one. In Proceedings of the ACM SIGPLAN '91 Conference on Programming Language Design and Implementation. ACM, New York, 80-91.
32. LAWALL, J. L. AND DANVY, O. 1993. Separating stages in the continuation-passing style transformation. In Conference Record of the 20th Annual ACM Symposium on Principles of Programming Languages. ACM, New York, 124-136.
33. LIU, Y. A. 1995. CACHET: An interactive, incremental-attribution-based program transformation system for deriving incremental programs. In Proceedings of the 10th Knowledge-Based Software Engineering Conference. IEEE CS Press, Los Alamitos, Calif., 19-26.
34. LIU, Y. A. 1997. Principled strength reduction. In Algorithmic Languages and Calculi, R. Bird and L. Meertens, Eds. Chapman & Hall. London, U.K., 357-381.
35. LIU, Y. A. 1998. Dependence analysis for recursive data. In Proceedings of the 1998 IEEE International Conference on Computer Languages. IEEE CS Press, Los Alamitos, Calif.
36. LIU, Y. A. AND STOLLER, S. D. 1998. Loop optimization for aggregate array computations. In Proceedings of the 1998 IEEE International Conference on Computer Languages. IEEE CS Press, Los Alamitos, Calif.
37. LIU, Y. A. AND TEITELBAUM, T. 1995. Systematic derivation of incremental programs. Sci. Comput. Program. 24, 1 (Feb.), 1-39.
38. LIU, Y. A., STOLLER, S. D., AND TEITELBAUM, T. 1996. Discovering auxiliary information for incremental computation. In Conference Record of the 23rd Annual ACM Symposium on Principles of Programming Languages. ACM, New York, 157-170.
39. MICHIE, D. 1968. "memo" functions and machine learning. Nature 218, 19-22.
40. MOGENSEN, T. 1989. Separating binding times in language specifications. In Proceedings of the 4th International Conference on Functional Programming Languages and Computer Architecture. ACM, New York, 12-25.
41. MOSTOW, D. J. AND COHEN, D. 1985. Automating program speedup by deciding what to cache. In Proceedings of the 9th International Joint Conference on Artificial Intelligence. Morgan Kaufmann Publishers, San Francisco, Calif., 165-172.
42. PAAKKI, J. 1995. Attribute grammar paradigms - A high-level methodology in language implementation. ACM Comput. Surv. 27, 2 (June), 196-255.
43. PAIGE, R. 1983. Transformational programming - Applications to algorithms and systems. In Conference Record of the 10th Annual ACM Symposium on Principles of Programming Languages. ACM, New York, 73-87.
44. PAIGE, R., 1990. Symbolic finite differencing - Part I. In Proceedings of the 3rd European Symposium on Programming. Lecture Notes in Computer Science, vol. 432. Springer-Verlag, Berlin, 36-56.
45. PAIGE, R. 1994. Viewing a program transformation system at work. In Proceedings of Joint 6th International Conference on Programming Languages: Implementations, Logics and Programs and 4th International Conference on Algebraic and Logic Programming, M. Hermenegildo and J. Penjam, Eds. Lecture Notes in Computer Science, vol. 844. Springer-Verlag, Berlin, 5-24.
46. PAIGE, R. AND KOENIG, S. 1982. Finite differencing of computable expressions. ACM Trans. Program. Lang. Syst. 4, 3 (July), 402-454.
47. PARTSCH, H. A. 1990. Specification and Transformation of Programs - A Formal Approach to Software Development. Springer-Verlag, Berlin.
48. PETTOROSSI, A. 1984. A powerful strategy for deriving efficient programs by transformation. In Conference Record of the 1984 ACM Symposium on LISP and Functional Programming. ACM, New York.
49. PETTOROSSI, A. 1987. Strategical derivation of on-line programs. In Program Specification and Transformation, L. G. L. T. Meertens, Ed. North-Holland, Amsterdam, 73-88.
50. PETTOROSSI, A. AND PROIETTI. M. 1997. Program derivation via list introduction. In Algorithmic Languages and Calculi, R. Bird and L. Meertens, Eds. Chapman & Hall, London, U.K.
51. PLOTKIN, G. D. 1975. Call-by-name, call-by-value and the A-calculus. Theoret. Comput. Sci. 1, 125-159.
52. PUGH, W. 1988. An improved cache replacement strategy for function caching. In Proceedings of the 1988 ACM Conference on LISP and Functional Programming. ACM, New York, 269-276.
53. PUGH, W. AND TEITELBAUM, T. 1989. Incremental computation via function caching. In Conference Record of the 16th Annual ACM Symposium on Principles of Programming Languages. ACM, New York, 315-328.
54. PURDOM, P. W. AND BROWN, C. A. 1985. The Analysis of Algorithms. Holt, Rinehart and Winston.
55. REPS, T. AND TEITELBAUM, T. 1988. The Synthesizer Generator: A System for Constructing Language-Based Editors. Springer-Verlag, New York.
56. REPS, T. AND TURNIDGE, T. 1996. Program specialization via program slicing. In Proceedings of the Dagstuhl Seminar on Partial Evaluation, O. Danvy, R. Glück, and P. Thiemann, Eds. Lecture Notes in Computer Science, vol. 1110. Springer-Verlag, Berlin, 409-429.
57. REPS, T., TEITELBAUM, T., AND DEMERS, A. 1983. Incremental context-dependent analysis for language-based editors. ACM Trans. Program. Lang. Syst. 5, 3 (July), 449-477.
58. ROSENDAHL, M. 1989. Automatic complexity analysis. In Proceedings of the 4th International Conference on Functional Programming Languages and Computer Architecture. ACM, New York, 144-156.
59. SCOTT, D. S. 1982. Lectures on a mathematical theory of computation. In Theoretical Foundations of Programming Methodology, M. Broy and G. Schmidt, Eds. D. Reidel Publishing Company, 145-292.
60. SMITH, D. R. 1990. KIDS: A semiautomatic program development system. IEEE Trans. Softw. Eng. 16, 9 (Sept.), 1024-1043.
61. SUNDARESH R. S. 1991. Building incremental programs using partial evaluation. In Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation. ACM, New York, 83-93.
62. SUNDARESH, R. S. AND HUDAK, P. 1991. Incremental computation via partial evaluation. In Conference Record of the 18th Annual ACM Symposium on Principles of Programming Languages. ACM, New York, 1-13.
63. TRAUB, K. R. 1986. A compiler for the MIT tagged-token dataflow architecture. M.S. thesis, Department of Electrical Engineering and Computer Science, MIT, Cambridge, Massachusetts. Appeared as Technical Report LCS TR-370, August, 1986.
64. WADLER, P. AND HUGHES, R. J. M. 1987. Projections for strictness analysis. In Proceedings of the 3rd International Conference on Functional Programming Languages and Computer Architecture. Lecture Notes in Computer Science, vol. 274. Springer-Verlag, Berlin, 385-407.
65. WEBB, J. A. 1992. Steps towards architecture-independent image processing. IEEE Comput. 25, 2 (Feb.), 21-31.
66. WEBBER, A. 1995. Optimization of functional programs by grammar thinning. ACM Trans. Program. Lang. Syst. 17, 2 (Mar.), 293-330.
67. WEBBER, A. B. 1993. Principled optimization of functional programs. Ph.D. thesis, Department of Computer Science, Cornell University, Ithaca, N.Y. Also appeared as Technical Report TR 93-1363, June 1993.
68. WEBBER, A. B. 1997. Program analysis using binary relations. In Proceedings of the ACM SIGPLAN '97 Conference on Programming Language Design and Implementation. ACM, New York, 249-160.
69. WEGBREIT, B. 1975. Mechanical program analysis. Commun. ACM 18, 9 (Sept.), 528-538.
70. WELLS, W. M., III. 1986. Efficient synthesis of Gaussian filters by cascaded uniform filters. IEEE Trans Patt. Anal. Mach. Intell. 8, 2 (Mar.), 234-239.
71. YEH, D. AND KASTENS, U. 1988. Improvements on an incremental evaluation algorithm for ordered attribute grammars. SIGPLAN Not. 23, 12, 45-50.
72. ZABIH, R. 1994. Individuating unknown objects by combining motion and stereo. Ph.D. thesis, Department of Computer Science, Stanford University, Stanford, Calif.
73. ZABIH, R. AND WOODFILL, J. 1994. Non-parametric local transforms for computing visual correspondence. In Proceedings of the 3rd European Conference on Computer Vision, J.-O. Eklundh, Ed. Lecture Notes in Computer Science, vol. 801. Springer-Verlag, 151-158.