Java Reference
In-Depth Information
[ACM]
[AGT89]
Alfred V. Aho, Mahadevan Ganapathi, and Steven W. K. Tjiang.
Code generation using tree matching and dynamic program-
ming. In
ACMTransactions on Programming Languages and Systems
,
11(4):491-516, October 1989.
[AK01]
Randy Allen and Ken Kennedy.
Optimizing Compilers for Modern
Architectures: A Dependence-based Approach
. Morgan Kaufmann,
San Francisco, CA, 2001.
[All70]
Frances E. Allen. Control flow analysis. In
Proceedings of the Sym-
posium on Compiler Optimization
, pages 1-19, Urbana-Champaign,
Illinois, 1970. ACM.
[App85]
Andrew W. Appel. Semantics-directed code generation. In
Pro-
ceedings of the ACM SIGACT-SIGPLAN Symposium on Principles of
Programming Languages
, pages 315-324, New Orleans, Louisiana,
1985. ACM.
[App92]
AndrewW. Appel.
Compiling with Continuations
. Cambridge Uni-
versity Press, New York, NY, 1992.
[App96]
Andrew Appel. Empirical and analytic study of stack versus
heap cost for languages with closures.
In
Journal of Functional
Programming
, 6(1):47-74, 1996.
[AWZ88] B.Alpern,M.N.Wegman,andF.K.Zadeck.Detectingequality
of variables in programs. In
Proceedings of the ACM SIGPLAN-
SIGACT Symposium on Principles of Programming Languages
,pages
1-11, San Diego, California, 1988. ACM.
[Bak82]
T. P. Baker. Aone-pass algorithmfor overload resolution inAda. In
ACMTransactions on Programming Languages and Systems
, 4(4):601-
614, 1982.
651
