[1] S.S. Muchnick, “Advanced Compiler Design Implementation”, Morgan Kaufmann Publishers, 1997, pp. 219-703.
[2] T. Kistler, and M. Franz, “Continuous Program Optimization: A Case Study”, ACM Transactions on Programming Language and Systems, Vol. 25, No. 4, July 2003, pp. 500-548.
[3] M. Schinz, M. Oderskey, “Tail Call Elimination on the Java Virtual Machine”, Published by Elsevier Science B.V., 2001.
[4] Y. Minamide, “Selective Tail Call Elimination”, Institute of Information Sciences and Electronics University of Tsukuba and PRESTO, JST.
[5] O. Waddell., R. K. Dybvig, “Fast and Effective Procedure Inlining”, Indiana University, Computer Science Department, Technical Report No. 484.
[6] H. G. Baker, “Inlining Semantics for Subroutines which are Recursive”, ACM Sigplan Notices 27, 12(Dec 1992), pp. 39-46.
[7] O. Chitil, “Common Subexpression Elimination in a Lazy Functional Language”, Lehrstuhl f¨ur Informatik II, Aachen University of Technology, Germany.
[8] J. W. Davidson, F. W. Christopher, “Eliminating Redundant Object Code”, ACM, 1982.
[9] L. Song, Y. Futamura, R. Gluck, Z. Hu, “A Loop Optimization Technique Based on Quasi Invariance”, 1999.
[10] C. K. Behera, P. Kumar, “An Improved Algorithm for Loop Dead Optimization”, ACM SIGPLAN, Vol. 41(5), May 2006.
[11] K. Deibel, “On the Automatic Detection of Loop Invariants”, February 25, 2002.
[12] R. Wilson et al., “An Overview of the SUIF Compiler System”, Computer Systems Lab, Stanford University, CA 94305.
[13] R. Wilson et al., “The SUIF Compiler System: A Parallelizing and Optimizing Research Compiler”, Technical Report CSL-TR-94-620, Computer Systems Laboratory, Departments of Electrical Engineering and Computer Science, Stanford University, CA 94305-4055.
[14] M. D. Smith, G. Holloway, “An Introduction to Machine SUIF and Its Portable Libraries for Analysis and Optimization”, Division of Engineering and Applied Sciences Harvard University, 2002