A new solution to the hidden copy problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1503 LNCS, Issue , 1998, Pages 327-348

  Goyal, Deepak ^a   Paige, Robert ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AGGREGATES; CLONE CELLS; FACSIMILE; JAVA PROGRAMMING LANGUAGE; SEMANTICS; STATIC ANALYSIS;

ABSTRACT INTERPRETATIONS; EFFICIENT STRATEGY; FUNCTIONAL LANGUAGES; IMPERATIVE LANGUAGES; LARGE AGGREGATES; LAZY COPYING; OPERATIONAL SEMANTICS; RECURSION EQUATIONS;

C++ (PROGRAMMING LANGUAGE);

EID: 84905050325     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49727-7_20     Document Type: Conference Paper

References (30)

1. ADA UK News, Vol. 6, No. 1, pp. 14-15, Jan 1985.
2. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques, and Tools. Addison Wesley, 1988.
3. J. Cai and R. Paige. Towards increased productivity of algorithm implementation. In Proc. ACM SIGSOFT, pages 71-78, Dec. 1993.
4. J. Cocke and J. Schwartz. Programming Languages and Their Compilers. Lecture Notes. Courant Institute, New York University, New York, 1969.
5. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixed points. In Proc. 4th ACM Symp. on Principles of Prog. Lang., pages 238-252, 1977.
6. A. Deutsch. A storeless model of aliasing and its abstractions using finite representations of right-regular equivalence relations. In International Conference on Computer Languages, pages 2-13. IEEE, 1992.
7. M. Draghicescu and S. Purushotham. A uniform treatment of order of evaluation and aggregate update. Theoretical Computer Science, 118:231-262, 1993.
8. C. A. R. Hoare. Data reliability. In Proc. of the Intl. Conf. on Reliable Software, pages 528-533, 1975.
9. J. Hopcroft. An n log n algorithm for minimizing states in a finite automaton. In Z. Kohavi and A. Paz, editors, Theory of Machines and Computations, pages 189-196. Academic Press, New York, 1971. Proc. Intl. Symp. on Theory of Machines and Computation.
10. P. Hudak. A semantic model of reference counting and its abstraction. In Proc. 1986 ACM Symp. on Lisp and Func. Prog., pages 351-363. ACM, 1986.
11. P. Hudak and A. Bloss. Avoiding copying in functional and logic programming languages. In Proc. 12th Annual ACM Symp. on Principles of Prog. Lang., pages 300-314. ACM, 1985.
12. G. Kahn. Natural semantics. In Proc. STACS'87. Springer-Verlag, 1987. Lecture Notes in Computer Science, Vol. 247.
13. J. B. Kam and J. D. Ullman. Monotone data flow analysis frameworks. Acta Informatica, 7:305-317, 1977.
14. J. Keller and R. Paige. Program derivation with verified transformations-a case study. CPAM, 48(9-10), 1995.
15. G. A. Kildall. A unified approach to global program optimization. In ACM Symp. on Principles of Prog. Lang., pages 194-206, 1973.
16. H. R. Nielson and F. Nielson. Semantics with Applications, A formal introduction. Wiley, 1992.
17. R. Paige. Viewing a program transformation system at work. In M. Hermenegildo and J. Penjam, editors, Programming Language Implementation and Logic, volume 844 of LNCS, pages 5-24. Springer-Verlag, Berlin, Sep. 1994. Proc. Joint 6th Intl. Conf. on Prog. Lang. Impl. and Logic Prog. (PLILP) and 4th Intl. Conf. on Algebraic and Logic Prog. (ALP).
18. R. Paige and Z. Yang. High level reading and data structure compilation. In Proc. 24th ACM SIGPLAN-SIGACT Symp. on Principles of Prog. Lang., pages 456-469, Paris, France, 15-17 Jan. 1997.
19. B. K. Rosen, M. Wegman, and K. Zadeck. Global value numbers and redundant computations. In ACM Symp. on Principles of Prog. Lang., pages 12-27, 1988.
20. M. Sagiv, T. Reps, and R. Wilhelm. Solving shape analysis problems in languages with destructive updating. ACM TOPLAS, 20(1):1-50, January 1998.
21. D. A. Schmidt. Data flow analysis is model checking of abstract interpretations. In 25th ACM SIGPLAN-SIGACT Symp. on Principles of Prog. Lang., 1998.
22. J. Schwartz. On Programming: An Interim Report on the SETL Project, Installments I and II. New York University, New York, 1974.
23. J. Schwartz. Automatic data structure choice in a language of very high level. CACM, 18(12):722-728, Dec. 1975.
24. J. Schwartz. Optimization of very high level languages, parts I, II. J. of Computer Languages, 1(2-3):161-218, 1975.
25. J. Schwartz, R. Dewar, E. Dubinsky, and E. Schonberg. Programming with Sets: An Introduction to SETL. Springer-Verlag, New York, 1986.
26. M. Sharir. A few cautionary notes on the convergence of iterative data-flow analysis algorithms. Setl Newsletter 208, New York University, April 1978.
27. K. Snyder. The SETL2 programming language. Technical Report 490, Courant Insititute, New York University, 1990.
28. R. E. Tarjan. A unified approach to path problems. JACM, 28(3):577-593, July 1981.
29. M. Wand and W. D. Clinger. Set constraints for destructive array update optimization. In Proc. IEEE Conf. on Computer Languages. IEEE, May 1998.
30. G. Winskell. The Formal Semantics of Programming Languages. Foundations of Computing. MIT Press, 1994.