Hybrid incremental alias algorithms

Proceedings of the Annual Hawaii International Conference on System Sciences

Volumn 2, Issue , 1991, Pages 428-437

  Marlowe, T J ^a   Ryder, B G ^b  

^a SETON HALL UNIVERSITY   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA TRANSFER; DIGITAL STORAGE; STATIC ANALYSIS;

ANALYSIS ALGORITHMS; DATA-FLOW INFORMATION; INCREMENTAL DATA; INTER-PROCEDURAL; PARALLEL HARDWARE; PROGRAM EXECUTION; SCIENTIFIC PROGRAMS; STORAGE LOCATION;

PROGRAM COMPILERS;

EID: 84936899059     PISSN: 15301605     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HICSS.1991.184005     Document Type: Conference Paper

References (42)

1. A. V. Aho R. Sethi J. D. Ullman. Compilers: Principles Techniques and Tools. Addison-Wesley 1986.
2. F. E. Allen, M. Burke, P. Charles, R. Cytron, and J. Fer-rante. An Overview of the PTRAN Analysis System for Multiprocessing. Journal of Parallel and Distributed Com. puting, 5:617-640, 1988.
3. J. Allen, D. Bamngartner, K. Kennedy, and A. Porter-field. PTOOL: A semi-automatic parallel programming assistant. Computer Science Technical Report COMP-TR-86-31, Computer Science Department, Rice University, January 1986.
4. J. Allen and K. Kennedy. Automatic translation of fortran to vector form. ACM Transactions on Programming Languages and Systems, 9(4):491-542, October 1987.
5. V. Balasundaram and K. Kennedy. A technique for summarizing data accesses and its use in parallelism enhancing transformations. In Proceedings of the SI GPL AN '89 Conference on Programming Language Design and Implementation, pages 41-53, July 1989. SIGPLAN Notices, 24(7).
6. J. Banning. An efficient way to find the side effects of procedure calls and the aliases of variables. In Conference Record of the Sixth Annual ACM Symposium on Principles of Programming Languages, pages 29-41. Association for Computing Machinery-SIGPLAN, January 1979.
7. M. Burke. An interval-based approach to exhaustive and incremental interprocedural data flow analysis. ACM Transactions on Programming Languages and Systems, 12(3):341-395, July 1990.
8. M. Burke and R. Cytron. Interprocedural dependence analysis and parallelization. In A CM Special Interest Group on Programming Languages, pages 162-175, July 1986. SIGPLAN Notices 21(6).
9. M. Burke and B. G. Ryder. Incremental iterative data flow analysis algorithms. IEEE Transactions on Software Engineering, 1990. to appear.
10. J. Cai and R. Paige. Program derivation by fixed point computation. Science of Computer Programming, 11(3):197-261, 1989.
11. D. Callahan and K. Kennedy. Analysis of interprocedural side effects in a parallel programming environment. In Proceedings of the First International Conference on Su-percomputing, Athens, Greece, June 1987.
12. M. D. Carroll and B. G. Ryder. Incremental data flow analysis via dominator and attribute updates. In Conference Record of the Fifteenth Annual ACM Sympoiium on Principles of Programming Language!, pages 274-284. Association for Computing Machinery-SIGPLAN, January 1988.
13. D. R. Chase, M. Wegman, and F. K. Zadeck. Analysis of pointers and structures. In Proceeding) of the SIGPLAN '90 Conference on Programming Language Design and Implementation, pages 296-310, June 1990. SIGPLAN Notices, Vol 25, No 6.
14. K. Cooper. Interprocedural data flow analysis in a programming environment. PhD thesis, Department of Mathematical Sciences, Rice University, Houston, TX, 1983.
15. K. Cooper. Analyzing aliases of formal reference parameters. In Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages, pages 281-290. Association for Computing Machinery-SIGPLAN, January 1985.
16. K. Cooper and K. Kennedy. Efficient computation of flow insensitive interprocedural summary information. In A CM Special Interest Group on Programming Languages, pages 247-258, June 1984. SIGPLAN Notices, 19(6).
17. K. Cooper and K. Kennedy. Fast interprocedural alias analysis. In Conference Record of the Sixteenth Annual A CM Symposium on Principles of Programming Languages, pages 49-59. Association for Computing Machinery-SIGPLAN, January 1989.
18. A. Deutsch. On determining lifetime and aliasing of dynamically allocated data in higher-order functional specifications. In Conference Record of the Seventeenth Annual A CM Symposium on Principles of Programming Languages, pages 157-168, January 1990.
19. V. Ghodssi. Incremental analysis of programs. PhD thesis, Department of Computer Science, University of Central Florida, 1983.
20. M. S. Hecht. Flow Analysis of Computer Programs. Elsevier North-Holland, 1977.
21. L. A. Henderson, R. E. Hiromoto, O. M. Lubeck, and M. L. Simmons. On the use of diagnostic dependence-analysis tools in parallel programming: Experiences using PTOOL. Journal of Supercomputing, 4(l):83-96, March 1990.
22. S. Horwitz, A. Demers, and T. Teitelbaum. An efficient general iterative algorithm for data flow analysis. Acta In-formatica, 24(6) :679-694, 1987.
23. S. Horwitz, P. Pfeiffer, and T. Reps. Dependence analysis for pointer variables. In Proceedings of the SIGPLAN '89 Conference on Programming Language Design and Implementation, pages 28-40, June 1989. SIGPLAN Notices 24(7).
24. J. Larus and P. Hilflnger. Detecting conflicts between structure accesses. In Proceedings of the SIGPLAN '88 Conference on Programming Language Design and Implementation, pages 21-34, July 1988. SIGPLAN Notices 23(7).
25. Y-F. Lee, T. J. Marlowe, and B. G. Ryder. Parallel hybrid data flow analysis algorithms. Technical Report CAIP-TR-190, Center for Computer Aids for Industrial Productivity (CAIP), Rutgers University, January 1990. To appear, ACM Supercomputing 90 Conference.
26. D. Lomet. Data flow analysis in the presence of procedure calls. IBM Journal of Research and Development, 21(6):559-571, November 1977.
27. T. J. Marlowe. Data flow analysis and incremental iteration. PhD thesis, Department of Computer Science, Rutgers University, New Brunswick, NJ, August 1989. Department of Computer Science Technical Report DCS-TR-255.
28. T. J. Marlowe and B. G. Ryder. Properties of data flow frameworks: A unified model. Laboratory for Computer Science Research Technical Report LCSR-TR-103, Department of Computer Science, Rutgers University, April 1988. to appear in Acta Informatica.
29. T. J. Marlowe and B. G. Ryder. Hybrid incremental algorithms for aliasing. Laboratory for Computer Science Research Technical Report LCSR-TR-129, Rutgers University, New Brunswick, NJ, September 1989.
30. T. J. Marlowe and B. G. Ryder. An efficient hybrid algorithm for incremental data flow analysis. In Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, pages 184-196. Association for Computing Machinery-SIGPLAN, January 1990.
31. E. Myers. A precise interprocedural data flow algorithm. In Conference Record of the Eighth Annual ACM Symposium on Principles of Programming Languages, pages 219-230. Association for Computing Machinery-SIGPLAN, January 1981.
32. A. Neirynck, P. Panangaden, and A. Demers. Computation of aliases and support sets. In Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, pages 274-283. Association for Computing Machinery-SIGPLAN, January 1987.
33. L. Pollock and M. L. Soffa. An incremental version of iterative data flow analysis. IEEE Transactions on Software Engineering, 15(12), December 1989.
34. C. D. Polychronopoulos, M. Girkar, M. R. Haghighat, C. L. Lee, B. Leung, and D. Schouten. Parafrase-2: An environment for parallelizing, partitioning, synchronizing, and scheduling programs on multiprocessors. In Conf. record of the 1989 international conference on parallel processing, pages 39-48, 1989.
35. B. Rosen. A lubricant for dataflow analysis. SI AM Journal of Computing, 11(3):493-511, 1982.
36. C. Ruggieri and T. Murtagh. Lifetime analysis of dynamically allocated objects. In Conference Record of the Fifteenth Annual A CM Symposium on Principles of Programming Languages, pages 285-293. Association for Computing Machinery-SIGPLAN, January 1988.
37. B. G. Ryder, W. Landi, and H. Pande. Profiling an incremental data flow analysis algorithm. IEEE Transactions on Software Engineering, 16(2):129-140, February 1990.
38. B. G. Ryder, T. J. Marlowe, and M. C. Paull. Conditions for incremental iteration: Examples and counterexamples. Science of Computer Programming, 11:1-15, 1988.
39. B. G. Ryder and M. C. Paull. Elimination algorithms for data flow analysis. ACM Computing Surveys, 18(3) :277-316, September 1986.
40. B. G. Ryder and M. C. Paull. Incremental data flow analysis algorithms. ACM Transactions on Programming Languages and Systems, 10(l):l-50, January 1988.
41. D. Yellin. A dynamic transitive closure algorithm. Technical Report Technical Report RC 13535, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 1988.
42. F. K. Zadeck. Incremental data flow analysis in a structured program editor. In Proceedings of the A CM SIGPLAN Symposium on Compiler Construction, pages 132-143, June 1984. SIGPLAN Notices, Vol 19, No 6.