Complete inlining of recursive calls: Beyond tail-recursion elimination

Proceedings of the Annual Southeast Conference

Volumn 2006, Issue , 2006, Pages 579-584

  Tang, Peiyi ^a  

^a University of Arkansas at Little Rock ^*  (United States)

Author keywords

Call graph; Complete inlining; Full control flow graph

Indexed keywords

CALL GRAPH; COMPLETE INLINING; FULL CONTROL FLOW GRAPH; RECURSIVE CALLS;

GRAPH THEORY; OPTIMIZATION; PROGRAM COMPILERS;

COMPUTER SYSTEMS PROGRAMMING;

EID: 34248387649     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1185448.1185574     Document Type: Conference Paper

References (15)

1. F. E. Allen and J. Cocke. A catalogue of optimizing transformations. In R. Ruskin, editor, Design and Implementation of Compilers. Prentice-Hall, 1971.
2. Andrew Ayers, Richard Schooler, and Robert Gottlieb. Aggressive inlining. In Proceedings of the ACM SIGPLAN 1997 Conference, on Programming Language Design and Implementation, pages 134-145, 1997.
3. Jan Hubicka. The gcc call graph module: A framework for inter-procedural optimization. In Proceedings of the GCC Developers' Summit, pages 65-78, June 2004.
4. Xavier Vera and Jingling Xue. Let's study whole-program cache behaviour analytically. In Proceedings of the 8th International Symposium on High-Performance Computer Architecture, pages 175-186, February 2002.
5. Steven S. Muchnick. Advanced Compiler Design and Implementation. Morgan Kaufmann Publishers, 1997.
6. Andreas Bauer. Compilation of Functional Programming Languages using GCC - Tail Calls. Master's thesis, Department of Informatics, Munich University of Technology, Munich, Germany, 2003.
7. Shin-Ming Liu, Raymond Lo, and Fred Chow. Loop induction variable canonicalization in parallelizing compilers. In Proceedings of the IEEE 1996 Conference on Parallel Architectures and Compilation Techniques, pages 228-237, 1996.
8. S. Pop, P. Claus, V. Loechner, and G.-A. Silber. Fast recognition of scalar evolutions on three-address SSA code. Technical Report A/354/CRI, Centre de Recherche en Informatique (CRI), 2004.
9. R. van Engelen, J. Birch, Y. Shou, B. Wash, and K. Gallivan. A unified framework for nonlinear dependence testing and symbolic analysis. In Proceedings of the ACM 18th International Conference on Supercomputing, pages 106-115, 2004.
10. Ken Kennedy and Randy Allen. Optimizing Compilers for Modern Architectures: A Dependence-based Approach. Morgan Kaufmann Publishers, 2002.
11. Peiyi Tang. Complete inlining of recursive calls: Beyond tail-recursion elimination. Technical Report titus.compsci.ualr.edu/~ptang/papers/btr.pdf, Department of Computer Science, University of Arkansas at Little Rock, 2005.
12. Afred V. Aho, Ravi Sethi, and Jeffery D. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley Publishing Company, 1986.
13. David Callahan. The program summary graph and flow-sensitive interprocedural data flow analysis. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 47-56, June 1988.
14. Peiyi Tang and Pen-Chung Yew. Interprocedural induction variable analysis. International Journal of Foundations of Computer Science, 14(3):405-423, June 2003.
15. Gagan Agrawal, Joel Salts, and Raja Das. Interprocedural partial redundancy elimination and its applications to distributed memory compilation. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 258-269, June 1995.