Incrementalization across object abstraction

Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications, OOPSLA

Volumn , Issue , 2005, Pages 473-486

  Liu, Yanhong A ^a   Stoller, Scott D ^a   Gorbovitski, Michael ^a   Rothamel, Tom ^a   Liu, Yanni Ellen ^b  

^a Stony Brook University   (United States)

^b UNIVERSITY OF MANITOBA   (Canada)

Author keywords

Abstraction; Design; Incrementalization; Invariants; Object oriented; Program analysis; Program optimization; Program transformation

Indexed keywords

OBJECT ABSTRACTION; PROGRAM ANALYSIS; PROGRAM TRANSFORMATION;

CONTROL SYSTEMS; LARGE SCALE SYSTEMS; OPTIMIZATION; QUERY LANGUAGES;

ABSTRACTING;

EID: 31744439555     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (51)

1. M. A. Ali, A. A. A. Fernandas, and N. W. Paton. Movie: an incremental maintenance system for materialized object views. Data Knowl. Eng., 47(2):131-166, 2003.
2. American National Standards Institute, Inc. Role-based access control. ANSI INCITS 359-2004. Approved Feb. 19, 2004. http://csrc.nist.gov/rbac/.
3. C. S. Ananian and M. Rinard. Data size optimizations for Java programs. In Proceedings of the 2003 ACM SIGPLAN Conference on Language, Compiler, and Tool for Embedded Systems, pages 59-68. ACM Press, 2003.
4. F. Bachmann et al. Volume II: Technical concepts of component-based software engineering, 2nd edition, Technical Report CMU/SEI-2000-TR-008, Software Engineering Institute, 2000.
5. D. F. Bacon and P. F. Sweeney. Fast static analysis of c++ virtual function calls. In Proceedings of the 11th ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, pages 324-341. ACM Press, 1996.
6. R. S. Bird. The promotion and accumulation strategies in transformational programming. ACM Trans. Program. Lang. Syst., 6(4):487-504, Oct. 1984.
7. B. Bloom and R. Paige. Transformational design and implementation of a new efficient solution to the ready simulation problem. Science of Computer Programming, 24(3): 189-220, 1995.
8. J. Gai, P. Facon, F. Henglein, R. Paige, and E. Schonberg. Type analysis and data structure selection. In Möller [33], pages 126-164.
9. S. Ceri and J. Widom. Deriving production rules for incremental view maintenance. In Proceedings of the 17th International Conference on Very Large Data Bases, pages 577-589. Morgan Kaufmann Publishers Inc., 1991.
10. J.-D. Choi, M. Burke, and P. Carini. Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects. In Conference Record of the 20th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 232-245, Charleston, South Carolina, 1993.
11. J. Cocke and K. Kennedy. An algorithm for reduction of operator strength. Commun. ACM, 20(11):850-856, Nov. 1977.
12. D. Cohen, N. Goldman, and K. Narayanaswamy. Adding performance information to ADT interface. In Proceedings of the Workshop on Interface Definition Languages, pages 84-93, 1994. Published as SIGPLAN Notices, 29(8).
13. J. Dean, G. DeFouw, D. Grove, V. Litvinov, and C, Chambers. Vortex: an optimizing compiler for object-oriented languages. In Proceedings of the 11th ACM SIGPLAN Conference, on Object-Oriented Programming, Systems, Languages, and Applications, pages 83-100. ACM Press, 1996.
14. E. W. Dijkstra. The humble programmer. Commun. ACM, 15(10):859-866, 1972.
15. A. Diwan, K. S. McKinley, and J. E. B. Moss. Using types to analyze and optimize object-oriented programs. ACM Trans. Program. Lang. Syst., 23(1):30-72, 2001.
16. D. Goyal and R. Paige. The formal reconstruction and improvement of the linear time fragment of willard's relational calculus subset. In R. Bird and L. Meertens, editors, Algorithmic Languages and Calculi, pages 382-414. Chapman & Hall, London, U.K., 1997.
17. D. Gries. The Science of Programming. Springer-Verlag, New York, 1981.
18. D. Gries. A note on a standard strategy for developing loop invariants and loops. Science of Computer Programming, 2:207-214, 1984.
19. A. Gupta, I. S. Mumick, and V. S. Subrahmanian. Maintaining views incrementally. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pages 157-166, May 1993.
20. C. A. R. Hoare. Proof of correctness of data representation. Acta Informatica, 1:271-281, 1972.
21. S. D. Johnson, Y. A. Liu, and Y. Zhang. A systematic incrementalization technique and its application to hardware design. International Journal on Software Tools for Technology Transfer, 4(2):211-223, 2003.
22. S. Katz. Program optimization using invariants. IEEE Trans. Softw. Eng., SE-4(5):378-389, Nov. 1978.
23. G. Kiczales, J. Lamping, A. Mendhekar, C. Maeda, C. Lopes, J.-M. Loingtier, and J. Irwin. Aspect-oriented programming. In M. Akşit and S. Matsuoka, editors, Proceedings of the 11th Europeen Conference on Object-Oriented Programming, volume 1241 of LNCS, pages 220-242. Springer Verlag, 1997.
24. D. Le Métayer. Ace: An automatic complexity evaluator. ACM Trans. Program. Lang. Syst., 10(2):248-266, Apr. 1988.
25. D. Liang, M. Pennings, and M. J. Harrold. Extending and evaluating flow-insenstitive and context-insensitive points-to analyses for Java. In Proceedings of the 2001 ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, pages 73-79. ACM Press, 2001.
26. B. Liskov and S. Zilles. Programming with abstract data types. In Proceedings of the ACM SIGPLAN Symposium on Very High Level Languages, pages 50-59, Apr. 1974.
27. Y. A. Liu and S. D. Stoller. From Datalog rules to efficient programs with time and space guarantees. In Proceedings of the 5th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, pages 172-183, Aug. 2003.
28. Y. A. Liu, S. D. Stoller, N. Li, and T. Rothamel. Optimizing aggregate array computations in loops. ACM Trans. Program. Lang. Syst., 27(1):91-125, Jan. 2005.
29. Y. A. Liu, S. D. Stoller, and T. Teitelbaum. Static caching for incremental computation. ACM Trans. Program. Lang. Syst., 20(3):546-585, May 1998.
30. Y. A. Liu, S. D. Stoller, and T. Teitelbaum. Strengthening invariants for efficient computation. Science of Computer Programming, 41(2):139-172, Oct. 2001.
31. An earlier version appeared in Conference Record of the 23rd Annual ACM Symposium on Principles of Programming Languages, 1996.
32. Y. A. Liu and T. Teitelbaum. Systematic derivation of incremental programs. Science of Computer Programming, 24(1):l-39, Feb. 1995.
33. L. G. L. T. Meertens, editor. Program Specification and Transformation. North-Holland, Amsterdam, 1987. Proceedings of the IFIP TC2/WG 2.1 Working Conference on Program Specification and Transformation, Bad Tölz, FRG, April 1986.
34. B. Möller, editor. Constructing Programs from Specifications. North-Holland, Amsterdam, 1991.
35. H. Nakamura. Incremental computation of complex object queries. In Proceedings of the 16th ACM SIGPLAN Conference on Object Oriented Programming, Systems, Languages, and Applications, pages 156-165. ACM Press, 2001.
36. F. Nielson, H. R. Nielson, and H. Seidl. Automatic complexity analysis, In Proceedings of the 11th European Symposium on Programming, volume 2305 of LNCS, pages 243-261. Springer-Verlag, Berlin, 2002.
37. R. Paige. Programming with invariants. IEEE Software, 3(1):56-69, Jan. 1986.
38. R. Paige. Real-time simulation of a set machine on a RAM. In Computing and Information, Vol. II, pages 69-73. Canadian Scholars Press, 1989. Proceedings of ICCI '89: The International Conference on Computing and Information, Toronto, Canada, May 23-27, 1989.
39. R. Paige and S. Koenig. Finite differencing of computable expressions. A CM Trans. Program. Lang. Syst., 4(3):402-454, July 1982.
40. R. Paige and R. Tarjan. Three partition refinement algorithms. SIAM J. Comput., 16(6):973-989, Dec. 1987.
41. D. L. Parnas. A technique for software module specification with examples. Commun, ACM, 15(5):330-336, May 1972.
42. H. A. Partsch. Specification and Transformation of Programs - A Formal Approach to Software Development, Springer-Verlag, Berlin, 1990.
43. T. Rothamel. On automatic data structure selection. Technical Report DAR 04-13, Computer Science Department, SUNY Stony Brook, May 2004.
44. E. Schonberg, J. Schwartz, and M. Sharir. An automatic technique for the selection of data representations in SETL programs. ACM Trans. Program. Lang. Syst., 3(2):126-143, Apr. 1981.
45. U. P. Schultz, J. L. Lawall, and C. Consel. Automatic program specialization for Java. ACM Trans. Program. Lang. Syst., 25(4):452-499, 2003.
46. D. R. Smith. KIDS: A semiautomatic program development system. IEEE Trans. Softw. Eng., 16(9):1024-1043, Sept. 1990.
47. D. R. Smith. A generative approach to aspect-oriented programming. In Proceedings of the 3rd International Conference on Generative Programming and Component Engineering, volume 3286 of LNCS, pages 39-54, Vancouver, Canada, Oct. 2004. Springer-Verlag.
48. J. M. Spivey. The Z Notation: A Reference Manual. Prentice-Hall, 2 edition, 1992.
49. J. Whaley and M. Rinard. Compositional pointer and escape analysis for Java programs. In Proceedings of the 14th ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, pages 187-206. ACM Press, 1999.
50. D. E. Willard. Quasilinear algorithms for processing relational calculus expressions (preliminary report). In Proceedings of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 243-257. ACM Press, 1990.
51. D. M. Yellin and R. E. Strom. INC: A language for incremental computations. ACM Trans. Program. Lang. Syst., 13(2):211-236, Apr. 1991.