Analysis of Pointers and Structures

ACM SIGPLAN Notices

Volumn 25, Issue 6, 1990, Pages 296-310

  Chase, David R ^a   Wegman, Mark ^b   Zadeck, F Kenneth ^c  

^a IBM T J Watson Research Center ^*  (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; DATA PROCESSING - DATA STRUCTURES;

COMPUTATIONAL MODELS;

COMPUTER OPERATING SYSTEMS;

EID: 0025444591     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/93548.93585     Document Type: Article

References (33)

1. J. B. Banning. An efficient way to find the side effects of procedure calls and the aliases of variables. Conf. Rec. Sixth ACM Symp. on Principles of Programming Languages, pages 29-41, January 1979.
2. J. M. Barth. Shifting garbage collection overhead to compile time. Comm. ACM, 20(7):513-518, July 1977.
3. J. M. Barth. A practical interprocedural data flow analysis algorithm. Comm. ACM, 21(9):724-736, September 1978.
4. H.-J. Boehm and L. Hederman. Storage allocation optimization in a compiler for Russell. Submitted for publication, July 1988.
5. M. Burke. An interval-based approach to exhaustive and incremental data flow analysis. Technical Report 12702, IBM, Yorktown Hts., New York, September 1987.
6. D. Callahan. The program summary graph and flow-sensitive interprocedural data flow analysis. Proc. SIGPLAN'88 Symp. on Compiler Construction, 23(7):47-56, July 1988.
7. R. Cytron, J. Ferrante, B.K. Rosen, M.N. Wegman, and F. K. Zadeck. An efficient method of computing static single assignment form. Conf. Rec. Sixteenth ACM Symp. on Principles of Programming Languages, pages 25-35, January 1989.
8. R. Cytron, J. Ferrante, B.K. Rosen, M.N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. Technical Report RC 14756, IBM, July 1989.
9. D. W. Clark and C. C. Green. An empirical study of list structure in LISP. Comm. ACM, 20(2):78-87, February 1977.
10. D. R. Chase. Garbage Collection and Other Optimizations. PhD thesis, Dept. of Computer Sci., Rice U., August 1987.
11. K. D. Cooper and K. Kennedy. Interprocedural side-effect analysis in linear time. Proc. SIGPLAN'88 Symp. on Compiler Construction, pages 57-66, June 1988. Published as SIGPLAN Notices Vol. 23, Num. 7.
12. K. D. Cooper and K. W. Kennedy. Fast interprocedural alias analysis. Conf. Rec. Sixteenth ACM Symp. on Principles of Programming Languages, pages 49-59, January 1989. Austin, Texas.
13. D. R. Chase, W. Wegman, and F. K. Zadeck. Fast insertion, deletion, and lookup in sparse ansestor trees. Technical Report CS-90-07, Dept. of Computer Sci., Brown U., March 1990.
14. L. Peter Deutsch and Daniel G. Bobrow. An efficient, incremental, automatic garbage collector. Comm. ACM, 19(9):522-526, September 1976.
15. A. Deutsch. On determining lifetime and aliasing of dynamically allocated data in higher-order functional specifications. Conf. Rec. Seventeenth ACM Symp. on Principles of Programming Languages, pages 157-168, January 1990.
16. L. Hederman. Compile time garbage collection. Master's thesis, Dept. of Computer Sci., Rice U., 1988.
17. L. J. Hendren and A. Nicolau. Parallelizing programs with recursive data structures. Proc. 1989 International Conf. on Parallel Processing, II:49-56, 1989.
18. S. Horwitz, P. Pfeiffer, and T. Reps. Dependence analysis for pointer variables. Proc. SIGPLAN'89 Symp. on Compiler Construction, June 1989. Published as SIGPLAN Notices Vol. 24. Num. 7.
19. P. Hudak. A semantic model of reference counting and its abstraction. In SIGPLAN Symposium on LISP and Functional Programming, pages 351-363, 1986.
20. N. D. Jones and S. S. Muchnick. Flow analysis and optimization of LISP-like structures. In S. S. Muchnick and N. D. Jones, editors, Program Flow Analysis, chapter 4, pages 102-131. Prentice-Hall, 1981.
21. N. D. Jones and S. S. Muchnick. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. Conf. Rec. Ninth ACM Symp. on Principles of Programming Languages, January 1982.
22. J. R. Larus. Restructuring symbolic programs for concurrent execution on multiprocessors. Technical Report UCB/CSD 89/502, Computer Sci. Dept., U. of California at Berkeley, Berkeley, CA, May 1989.
23. J. R. Larus and P. N. Hilfinger. Detecting conflicts between structure accesses. Proc. SIGPLAN'88 Symp. on Compiler Construction, pages 21-34, July 1988. Published as SIGPLAN Notices Vol. 23, Num. 7.
24. E. W. Myers. A precise interprocedural data flow algorithm. Conf. Rec. Eighth ACM Symp. on Principles of Programming Languages, pages 219-230, January 1981.
25. C. Ruggieri and T. P. Murtagh. Lifetime analysis of dynamically allocated objects. Conf. Rec. Fifteenth ACM Symp. on Principles of Programming Languages, pages 285-293, January 1988.
26. P. Rovner. On adding garbage collection and runtime types to a strongly-typed, statically checked, concurrent language. Technical Report CSL-84-7, Xerox Palo Alto Research Center, Palo Alto, Ca. 94304, 1985.
27. C. Ruggieri. Dynamic Memory Allocation Techniques Based on the Lifetimes of Objects. PhD thesis, Purdue University, August 1987.
28. J. T. Schwartz. Optimization of very high level languages-I: Value transmission and its corollaries. Computer Languages, 1:161-194, 1975.
29. J. T. Schwartz. Optimization of very high level languages-II: Deducing relationships of inclusion and membership. Computer Languages, 1:197-218, 1975.
30. W. R. Stoye, T. J. W. Clarke, and A. C. Norman. Some practical methods for rapid combinator reduction. SIGPLAN Symposium on LISP and Functional Programming, pages 159-166, 1984.
31. J. Stransky. Analyse sémantique de structures de données dynamiques avec application au cas particulier de langages LISPiens. PhD thesis, Université de Paris-Sud, Centre d'Orsay, June 1988.
32. B. Wegbreit. Property extraction in well-founded property sets. IEEE Trans. on Software Engineering, SE-1(3):270-285, September 1975.
33. M. N. Wegman and F. K. Zadeck. Constant propagation with conditional branches. Technical Report CS-88-02, Dept. of Computer Sci., Brown U., February 1988.