Efficiency by incrementalization: an introduction

Higher-Order and Symbolic Computation

Volumn 13, Issue 4, 2000, Pages 289-313

  Liu, Yanhong A ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CACHE MEMORY; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; ITERATIVE METHODS; LINGUISTICS; PROGRAM COMPILERS;

CACHING; INCREMENTAL COMPUTATION; INCREMENTAL PROGRAM; INCREMENTALIZATION; PROGRAM ANALYSIS;

PROGRAMMING THEORY;

EID: 0034504879     PISSN: 13883690     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1026547031739     Document Type: Article

References (90)

1. Abadi, M., Lampson, B., and Lévy, J.-J. Analysis and caching of dependencies. In Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming, 1996, pp. 83-91.
2. Aho, A.V., Hopcroft, J.E., and Ullman, J.D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.
3. Aho, A.V., Sethi, R., and Ullman, J.D. Compilers, Principles, Techniques, and Tools. Addison-Wesley, Reading, Mass., 1986.
4. Allen, F.E. Program optimization. In Annual Review of Automatic Programming, Vol. 5. Pergamon Press, New York, 1969, pp. 239-307.
5. Allen, F.E., Cocke, J., and Kennedy, K. Reduction of operator strength. In Program Flow Analysis, S.S. Muchnick and N.D. Jones (Eds.). Prentice-Hall, Englewood Cliffs, N.J., 1981, pp. 79-101.
6. Alpern, B., Hoover, R., Rosen, B., Sweeney, P., and Zadeck, K. Incremental evaluation of computational circuits. In Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, 1990, pp. 32-42.
7. Bauer, F.L., Möller, B., Partsch, H., and Pepper, P. Formal program construction by transformations - computer-aided, intuition-guided programming. IEEE Trans. Softw. Eng. 15(2) (1989) 165-180.
8. Bird, R.S. Tabulation techniques for recursive programs. ACM Comput. Surv. 12(4) (1980) 403-417.
9. Bird, R.S. The promotion and accumulation strategies in transformational programming. ACM Trans. Program. Lang. Syst. 6(4) (1984) 487-504.
10. Bird, R.S. Addendum: The promotion and accumulation strategies in transformational programming. ACM Trans. Program. Lang. Syst. 7(3) (1985) 490-492.
11. Bloom, B. and Paige, R. Transformational design and implementation of a new efficient solution to the ready simulation problem. Sci. Comput. Program. 24(3) (1995) 189-220.
12. Borras, P., Clément, D., Despeyroux, T., Incerpi, J., Kahn, G., Lang, B., and Pascual, V. CENTAUR: The system. In Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, 1988, pp. 14-24.
13. Boyer, R.S. and Moore, J.S. A Computational Logic, ACM Monograph Series. Academic Press, New York, 1979.
14. Broy, M. Algebraic methods for program construction: The project CIP. In Program Transformation and Programming Environments, P. Pepper (Ed.). Springer-Verlag, Berlin, 1984, pp. 199-222.
15. Burstall, R.M. and Darlington, J. A transformation system for developing recursive programs. J. ACM 24(1) (1977) 44-67.
16. Cocke, J. and Kennedy, K. An algorithm for reduction of operator strength. Commun. ACM 20(11) (1977) 850-856.
17. Cocke, J. and Schwartz, J.T. Programming languages and their compilers; preliminary notes. Technical report, Courant Institute of Mathematical Sciences, New York University, 1970.
18. Cohen, N.H. Eliminating redundant recursive calls. ACM Trans. Program. Lang. Syst. 5(3) (1983) 265-299.
19. Cormen, T.H., Leiserson, C.E., and Rivest, R.L. Introduction to Algorithms. The MIT Press/McGraw-Hill, Cambridge, MA, 1990.
20. Dershowitz, N. The Evolution of Programs, Vol. 5 of Progress in Computer Science. Birkhäuser, Boston, 1983.
21. Dijkstra, E.W. A Discipline of Programming, Prentice-Hall Series in Automatic Computation. Prentice-Hall, Englewood Cliffs, N.J., 1976.
22. Earley, J. High level iterators and a method for automatically designing data structure representation. J. Comput. Lang, 1 (1976) 321-342.
23. Eppstein, D., Galil, Z., Italiano, G.F., and Nissenzweig, A. Sparsification - A technique for speeding up dynamic graph algorithms. In Proceedings of the 33rd Annual IEEE Symposium on FOCS, 1992, pp. 60-69.
24. Eppstein, D., Italiano, C.F., Tamassia, R., Tarjan, R.E., Westbrook, J., and Yung, M. Maintenance of a minimum spanning forest in a dynamic planar graph. In Proceedings of SODA '90, 1990, pp. 1-11.
25. Field, J. and Teitelbaum, T. Incremental reduction in the lambda calculus. In Proceedings of the 1990 ACM Conference on LISP and Functional Programming, 1990, pp. 307-322.
26. Fong, A.C. Generalized Common Subexpressions in Very High Level Languages. In Conference Record of the 4th Annual ACM Symposium on Principles of Programming Languages, 1977, pp. 48-57.
27. Fong, A.C. Inductively computable constructs in very high level languages. In Conference Record of the 6th Annual ACM Symposium on Principles of Programming Languages, 1979, pp. 21-28.
28. Fong, A.C. and Ullman, J.D. Inductive variables in very high level languages. In Conference Record of the 3rd Annual ACM Symposium on Principles of Programming Languages, 1976, pp. 104-112.
29. Frederickson, G.N. Data Structures for on-line updating of minimum spanning trees, with applications. SIAM J. Comput. 14(4) (1985)781-798.
30. Freeman-Benson, B.N., Maloney, J., and Borning, A. An incremental constraint solver. Commun. ACM 33(1) (1990) 54-63.
31. Goldstine, H.H. Charles Babbage and his analytical engine. In The Computer from Pascal to von Neumann. Princeton University Press, Princeton, New Jersey, 1972, Chapt. 2, pp. 10-26.
32. Gómez, G. and Liu, Y.A. Automatic time-bound analysis for a higher-order language. Technical Report TR 535, Computer Science Department, Indiana University, 1999.
33. Goyal, D. A language theoretic approach to algorithms. Ph.D. Thesis, Department of Computer Science, New York University, 2000.
34. Goyal, D. and Paige, R. The formal reconstruction and improvement of the linear time fragment of Willard's relational calculus subset. In Algorithmic Languages and Calculi, R. Bird and L. Meertens (Eds.). Chapman & Hall, London, UK, 1997, pp. 382-414.
35. Gries, D. Compiler Construction for Digital Computers. John Wiley & Sons, New York, 1971.
36. Gries, D. The Science of Programming. Springer-Verlag, New York, 1981.
37. Gries, D. A note on a standard strategy for developing loop invariants and loops. Sci. Comput. Program. 2 (1984) 207-214.
38. Highnam, P.T. Systems and programming issues in the design and use of a SIMD linear array for image processing. Ph.D. Thesis, Department of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, 1991.
39. Hoover, R. Alphonse: Incremental computation as a programming abstraction. In Proceedings of the ACM SIGPLAN '92 Conference on Programming Language Design and Implementation, 1992, pp. 261-272.
40. Hughes, J. Lazy memo-functions. In Proceedings of the 2nd Conference on Functional Programming Languages and Computer Architecture, Vol. 201 of Lecture Notes in Computer Science, 1985, pp. 129-146.
41. Jalili, F. and Gallier, J.H. Building friendly parsers. In Conference Record of the 9th Annual ACM Symposium on Principles of Programming Languages, 1982, pp. 196-206.
42. Klarlund, N. MONA Version 1.3 User Manual, 1998.
43. Knoop, J., Rüthing, O., and Steffen, B. Lazy strength reduction. Journal of Programming Languages 1(1) (1993) 71-91.
44. Liu, Y.A. CACHET: An interactive, incremental-attribution-based program transformation system for deriving incremental programs. In Proceedings of the 10th Knowledge-Based Software Engineering Conference, 1995, pp. 19-26.
45. Liu, Y.A. Incremental computation: A semantics-based systematic transformational approach. Ph.D. Thesis, Department of Computer Science, Cornell University, Ithaca, New York, 1996.
46. Liu, Y.A. Principled strength reduction. In Algorithmic Languages and Calculi, Chapman & Hall, London, 1997, pp. 357-381.
47. Liu, Y.A. Dependence analysis for recursive data. In Proceedings of the IEEE 1998 International Conference on Computer Languages, 1998, pp. 206-215.
48. Liu, Y.A. and Gómez, G. Automatic accurate time-bound analysis for high-level languages. In Proceedings of the ACM SIGPLAN 1998 Workshop on Languages, Compilers, and Tools for Embedded Systems, Vol. 1474 of Lecture Notes in Computer Science, 1998, pp. 31-40.
49. Liu, Y.A. and Stoller, S.D. Loop optimization for aggregate array computations. In Proceedings of the IEEE 1998 International Conference on Computer Languages, 1998, pp. 262-271.
50. Liu, Y.A. and Stoller, S.D. Dynamic programming via static incrementalization. In Proceedings of the 8th European Symposium on Programming, Vol. 1576 of Lecture Notes in Computer Science, 1999, pp. 288-305.
51. Liu, Y.A. and Stoller, S.D. Eliminating dead code on recursive data. In Proceedings of the 6th International Static Analysis Symposium, Vol. 1694 of Lecture Notes in Computer Science, 1999, pp. 211-231.
52. Liu, Y.A., Stoller, S.D., and Teitelbaum, T. Discovering auxiliary information for incremental computation. In Conference Record of the 23rd Annual ACM Symposium on Principles of Programming Languages, 1996, pp. 157-170.
53. Liu, Y.A., Stoller, S.D., and Teitelbaum, T. Static caching for incremental computation. ACM Trans. Program. Lang. Syst. 20(3) (1998) 546-585.
54. Liu, Y.A. and Teitelbaum, T. Systematic derivation of incremental programs. Sci. Comput. Program. 24(1) (1995) 1-39.
55. Manna, Z. and Waldinger, R. A deductive approach to program synthesis. ACM Trans. Program. Lang. Syst. 2(1) (1980) 90-121.
56. Manna, Z. and Waldinger, R. The Deductive Foundations of Computer Programming. Addison-Wesley, Reading, Mass., 1993.
57. Michie, D. "Memo" Functions and machine learning. Nature 218 (1968) 19-22.
58. O'Leary, J., Leeser, M., Hickey, J., and Aagaard, M. Non-restoring integer square root: A case study in design by principled optimization. In Proceedings of the 2nd International Conference on Theorem Provers in Circuit Design: Theory, Practice, and Experience, Vol. 901 of Lecture Notes in Computer Science, R. Kumar and T. Kropf (Eds.). 1995, pp. 52-71.
59. Paige, B. and Schwartz, J.T. Expression continuity and the formal differentiation of algorithms. In Conference Record of the 4th Annual ACM Symposium on Principles of Programming Languages, 1977, pp. 58-71.
60. Paige, R. Programming with invariants. IEEE Software 3(1) (1986) 56-69.
61. Paige, R. Symbolic finite differencing - Part I. In Proceedings of the 3rd European Symposium on Programming, Vol. 432 of Lecture Notes in Computer Science, 1990, pp. 36-56.
62. Paige, R. 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, Vol. 844 of Lecture Notes in Computer Science, M. Hermenegildo and J. Penjam (Eds.). 1994, pp. 5-24.
63. Paige, R. and Koenig, S. Finite differencing of computable expressions. ACM Trans. Program. Lang. Syst. 4(3) (1982) 402-454.
64. Paige, R. and Tarjan, R. Three partition refinement algorithms. SIAM J. Comput. 16(6) (1987) 973-989.
65. Partsch, H.A. Specification and Transformation of Programs - A Formal Approach to Software Development. Springer-Verlag, Berlin, 1990.
66. Pettorossi, A. A powerful strategy for deriving efficient programs by transformation. In Conference Record of the 1984 ACM Symposium on LISP and Functional Programming, 1984.
67. Pugh, W. The Omega Test: A fast and practical integer programming algorithm for dependence analysis. Commun. ACM 31(8) (1992) 102-114.
68. Pugh, W. and Teitelbaum, T. Incremental computation via function caching. In Conference Record of the 16th Annual ACM Symposium on Principles of Programming Languages, 1989, pp. 315-328.
69. Purdom, P.W. and Brown, C.A. The Analysis of Algorithms. Holt, Rinehart and Winston, 1985.
70. Ramalingam, G. and Reps, T. A categorized bibliography on incremental computation. In Conference Record of the 20th Annual ACM Symposium on Principles of Programming Languages, 1993, pp. 502-510.
71. Ramalingam, G. and Reps, T. An incremental algorithm for a generalization of the shortest-path problem. Journal of Algorithms 21 (1996) 267-305.
72. Rauch, M. Improved data structures for fully dynamic biconnectivity. In Conference Proceedings of the 26th Annual ACM STOC, 1994, pp. 686-695.
73. Reps, T. and Teitelbaum, T. The Synthesizer Generator: A System for Constructing Language-Based Editors. Springer-Verlag, New York, 1988.
74. Reps, T., Teitelbaum, T., and Demers, A. Incremental context-dependent analysis for language-based editors. ACM Trans. Program. Lang. Syst. 5(3) (1983) 449-477.
75. Reynolds, J.C. The Craft of Programming. Prentice-Hall, Englewood Cliffs, N.J., 1981.
76. Rosendahl, M. Automatic complexity analysis. In Proceedings of the 4th International Conference on Functional Programming Languages and Computer Architecture, 1989, pp. 144-156.
77. Ryder, B.G. and Paull, M.C. Incremental data flow analysis algorithms. ACM Trans. Program. Lang. Syst. 10(1) (1988) 1-50.
78. Sands, D. Total correctness by local improvement in program transformation. In Conference Record of the 22nd Annual ACM Symposium on Principles of Programming Languages, 1995, pp. 221-232.
79. Sleator, D.D. and Tarjan, R.E. A data structure for dynamic trees. Journal of Computer and System Sciences 26 (1983) 362-391.
80. Smith, D.R. KIDS: A semiautomatic program development system. IEEE Trans. Softw. Eng. 16(9) (1990) 1024-1043.
81. Sundaresh, R.S. and Hudak, P. Incremental computation via partial evaluation. In Conference Record of the 18th Annual ACM Symposium on Principles of Programming Languages, 1991, pp. 1-13.
82. Tarjan, R.E. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, Pennsylvania, 1983.
83. Webber, A. Optimization of functional programs by grammar thinning. ACM Trans. Program. Lang. Syst. 17(2) (1995) 293-330.
84. Wegbreit, B. Mechanical program analysis. Commun. ACM 18(9) (1975) 528-538.
85. Wells, III, W.M. Efficient synthesis of Gaussian filters by cascaded uniform filters. IEEE Trans. Patt. Anal. Mach. Intell. 8(2) (1986) 234-239.
86. Yeh, D. and Kastens, U. Improvements on an incremental evaluation algorithm for ordered attribute grammars. SIGPLAN Notices 23(12) (1988) 45-50.
87. Yellin, D.M. Speeding up dynamic transitive closure for bounded degree graphs. Acta Informatica 30(4) (1993) 369-384.
88. Yellin, D.M. and Strom, R.E. INC: A language for incremental computations. ACM Trans. Program. Lang. Syst. 13(2) (1991) 211-236.
89. Zabih, R. Individuating unknown objects by combining motion and stereo. Ph.D. Thesis, Department of Computer Science, Stanford University, Stanford, Calif., 1994.
90. Zhang, Y and Liu, Y.A. Automating derivation of incremental programs. In Proceedings of the 1998 ACM SIGPLAN International Conference on Functional Programming, 1998, p. 350.