A flexible approach to interprocedural data flow analysis and programs with recursive data structures

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 1982, Pages 66-74

  Jones, Neil D ^a   Muchnick, Steven S ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b HEWLETT PACKARD COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION LANGUAGES; DATA FLOW ANALYSIS; DATA STRUCTURES; DATA TRANSFER;

INTER-PROCEDURAL; NEW APPROACHES; RECURSIVE DATA STRUCTURES;

PROGRAM INTERPRETERS;

EID: 85051014774     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/582153.582161     Document Type: Conference Paper

References (16)

1. Bar78 Barth, Jeffrey, A Practical Interprocedural Data Flow Analysis Algorithm, Comra. of the ACM, vol. 21, no. 9, 1978, pp. 724-736.
2. Cou77a Cousot, Patrick & Radhia Cousot, Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints, Conf. Rec. of 4th ACM Symp. on Princ. of Prog. Lang., Los Angeles, California, January 1977, pp. 238-252.
3. Cou77b Cousot, Patrick & Radhia Cousot, Automatic Synthesis of Optimal Invariant Assertions: Mathematical Foundations, Proc. of ACM Symp, on Artif. Intell. and Prog. Lang., SIGPLAN Notices, vol. 12, no. 8, August 1977, pp. 1-12.
4. Cou79 Cousot, Patrick & Radhia Cousot, Systematic Design of Program Analysis Frameworks, Conf, Pec. of 6th ACM Symp. on Princ. of Prog. Lang., January 1979, pp. 269-282.
5. Eng75 Engelfriet, Joost, Tree Automata and Tree Grammars. DAIMI Report FN-10, Dept. of Computer Science, University of Aarhus, Aarhus, Denmark, April 1975.
6. Hec77 Hecht, Matthew S., Flow Analysis of Computer Programs. Elsevier North-Holland, New York, 1977.
7. JOM8I Jones, Neil D. & Steven S. Muchnick, Flow Analysis and Optimization of LISP-Like Structures, in Steven S. Muchnick & Neil D. Jones (eds.). Program Flow Analysis: Theory and Applications, Prentice-Hall, Englewood Cliffs, New Jersey, 1981, pp. 102-131.
8. Jon80 Jones, Neil D., Flow Analysis of Lambda Expressions, Technical Report DAIMI IR-23, Computer Science Department, University of Aarhus, Aarhus, Denmark, October 1980.
9. Ken76 Kennedy, Ken, A Comparison of Two Algorithms for Global Data Flow Analysis, SI AM J. Comput, vol. 5, no. 1, 1976, pp. 158-180.
10. KU73 Kildall, G. A., A Unified Approach to Global Program Optimization, Conf. Rec. of the ACM Symp. on Princ. of Prog. Lang., Boston, - Massachusetts, October 1973, pp. 194-206.
11. McC63 McCarthy, John, Towards a Mathematical Science of Computation, Information Processing 1962, North-Holland, Amsterdam, 1963, pp. 220-226.
12. Nie80 Nielson, Flemming, Semantic Foundations of Data Flow Analysis, Technical Report DAIMI PB-131, Computer Science Department, Aarhus University, Aarhus, Denmark, February 1981.
13. Rei79 Reif, John H., Data Flow Analysis of Communicating Processes, Conf. Rec. of the 6th ACM Symp. on Princ. of Prog. Lang., San Antonio, Texas, January 1979, pp. 357-368.
14. Sin72 Sintzoff, Michel, Calculating Properties of Programs by Valuations on Specific Models, Proc. ACM Conf. on Proving Assertions about Programs, Las Cruces, New Mexico, January 1972, pp. 203-207.
15. ShP81 Sharir, Micha & Amir Pnueli, Two Approaches to Interprocedural Data Flow Analysis, in Steven S. Muchnick & Neil D. Jones (eds.), Program Flow Analysis: Theory and Applications, Prentiee-Hall, Englewood Cliffs, New Jersey, 1981, pp. 189-234.
16. Tha73 Thatcher, James W., Tree Automata: An Informal Survey, in Alfred V. Aho (ed.), Currents in the Theory of Computing, Prentice-Hall, Englewood Cliffs, New Jersey, 1973, pp. 143-172.