Interprocedural Control Flow Analysis of First-Order Programs with Tail-Call Optimization

ACM Transactions on Programming Languages and Systems

Volumn 19, Issue 4, 1997, Pages 568-585

  Debray, Saumya K ^a   Proebsting, Todd A ^a  

^a University of Arizona   (United States)

Author keywords

Algorithms; Control flow analysis; D.3.4 Programming Languages ; Languages; Processors optimization; Theory

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CONTEXT FREE GRAMMARS; OPTIMIZATION;

FIRST ORDER PROGRAMS; INTERPROCEDURAL CONTROL FLOW ANALYSIS; PARSING THEORY; TAIL CALL OPTIMIZATION;

PROGRAM PROCESSORS;

EID: 0031191619     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/262004.262006     Document Type: Article

References (23)

1. AHO, A. V., SETHI, R., AND ULLMAN, J. D. 1986. Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading, Mass.
2. BOSSCHERE, K. D. AND DEBRAY, S. K. 1996. alto: A link-time optimizer for the dec alpha. Technical Report TR-96-15, Dept. of Computer Science, The Univ. of Arizona, Tucson, Ariz.
3. CHOI, J. D., BURKE, M., AND CARINI, P. 1993. Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects. In Proceedings of the 20th ACM Symposium on Principles of Programming Languages. ACM, New York, 232-245.
4. DEBRAY, S. K. AND PROEBSTING, T. A. 1996. Interprocedural control flow analysis of first-order programs with tail call optimization. Technical Report TR-96-20, Dept. of Computer Science, The Univ. of Arizona, Tucson, Ariz. Available as ftp://ftp.cs.arizona.edu/reports/1996/TR96-20.ps.
5. HEINTZE, N. 1994. Control flow analysis and type systems. Technical Report CMU-CS-94-227, School of Computer Science, Carnegie Mellon Univ., Pittsburgh, Pa.
6. HENGLEIN, F. AND JØRGENSEN, J. 1994. Formally optimal boxing. In Proceedings of the 21st ACM Symposium on Principles of Programming Languages. ACM, New York, 213-226.
7. HOPCROFT, J. E. AND ULLMAN, J. D. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Mass.
8. JAGANNATHAN, S. AND WEEKS, S. 1995. A unified treatment of flow analysis in higher-order languages. In Proceedings of the 22nd ACM Symposium on Principles of Programming Languages. ACM, New York, 393-407.
9. LANDI, W. AND RYDER, B. G. 1992. A safe approximate algorithm for interprocedural pointer aliasing. In Proceedings of the ACM SIGPLAN '92 Conference on Programming Language Design and Implementation. ACM, New York, 235-248.
10. LEROY, X. 1992. Unboxed objects and polymorphic typing. In Proceedings of the 19th ACM Symposium on Principles of Programming Languages. ACM, New York, 177-188.
11. LINDGREN, T. 1995. Control flow analysis of prolog. In Proceedings of the 1995 International Symposium on Logic Programming. MIT Press, Cambridge, Mass., 432-446.
12. PAULSON, L. C. 1991. ML for the Working Programmer. Cambridge University Press, United Kingdom.
13. PETERSON, J. C. 1989. Untagged data in tagged environments: Choosing optimal representation at compile time. In Proceedings of Functional Programming Languages and Computer Architecture. Springer-Verlag, Berlin, 89-99.
14. PEYTON JONES, S. AND LAUNCHBURY, J. 1991. Unboxed values as first class citizens in a nonstrict functional language. In Proceedings of Functional Programming Languages and Computer Architecture. Springer-Verlag, Berlin, 636-666.
15. PROEBSTING, T. A. AND WATTERSON, S. A. 1996. Filter fusion. In Proceedings of the 23rd ACM Symposium on Principles of Programming Languages. ACM, New York, 119-129.
16. RUF, E. 1995. Context-insensitive alias analysis reconsidered. In Proceedings of the SIGPLAN '95 Conference on Programming Language Design and Implementation. ACM, New York, 13-22.
17. SHARIR, M. AND PNUELI, A. 1981. Two approaches to interprocedural dataflow analysis. In Program Flow Analysis: Theory and Applications, S. S. Muchnick and N. D. Jones, Eds. Prentice-Hall, Englewood Cliffs, N.J., 189-233.
18. SHIVERS, O. 1988. Control flow analysis in scheme. In Proceedings of the SIGPLAN '88 Conference on Programming Language Design and Implementation. ACM, New York, 164-174.
19. SHIVERS, O. 1991. Control flow analysis of higher-order languages. Ph.D. thesis, Carnegie Mellon Univ., Pittsburgh, Pa. Also available as Tech. Rep. CMU-CS-91-145, School of Computer Science, Carnegie Mellon Univ.
20. TANG, Y. AND JOUVELOT, P. 1992. Control-flow effects for escape analysis. In Proceedings of Workshop on Static Analysis (WSA) '92. Springer-Verlag, Berlin.
21. TANG, Y. AND JOUVELOT, P. 1994. Separate abstract interpretation for control flow analysis. In Proceedings of TACS-94. Springer-Verlag, Berlin.
22. TARDITI, D., MORRISETT, G., CHENG, P., STONE, C., HARPER, R., AND LEE, P. 1966. TIL: A type-directed optimizing compiler for ML. In Proceedings of the SIGPLAN '96 Conference on Programming Language Design and Implementation. ACM, New York, 181-192.
23. WILSON, R. P. AND LAM, M. S. 1995. Efficient context-sensitive pointer analysis for C programs. In Proceedings of the SIGPLAN '95 Conference on Programming Language Design and Implementation. ACM, New York, 1-12.