-
1
-
-
0004072686
-
-
Addison Wesley
-
Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers Principles, Techniques, and Tools. Addison Wesley, 1986.
-
(1986)
Compilers Principles, Techniques, and Tools
-
-
Aho, A.V.1
Sethi, R.2
Ullman, J.D.3
-
2
-
-
0016928266
-
A program data flow analysis procedure
-
March
-
F. E. Allen and J. Cocke. A program data flow analysis procedure. CACM, 19(3):137-147, March 1976.
-
(1976)
CACM
, vol.19
, Issue.3
, pp. 137-147
-
-
Allen, F.E.1
Cocke, J.2
-
5
-
-
0029703704
-
Fast, effective dynamic compilation
-
21- May
-
Joel Auslander, Matthai Philipose, Craig Chambers, Susan J. Eggers, and Brian N. Bershad. Fast, effective dynamic compilation. In Proceedings of the ACM SIGPLAN '96 Conference on Programming Language Design and Implementation, pages 149-159, 21- May 1996.
-
(1996)
Proceedings of the ACM SIGPLAN '96 Conference on Programming Language Design and Implementation
, pp. 149-159
-
-
Auslander, J.1
Philipose, M.2
Chambers, C.3
Eggers, S.J.4
Bershad, B.N.5
-
8
-
-
0347295068
-
-
PhD thesis, University of Pittsburgh, in preparation
-
Rastislav Bodik. Path-Sensitive Compilation. PhD thesis, University of Pittsburgh, in preparation.
-
Path-Sensitive Compilation
-
-
Bodik, R.1
-
12
-
-
0030672497
-
A new algorithm for partial redundancy elimination based on SSA form
-
June
-
F. Chow, S. Chan, R. Kennedy, S.-M. Liu, R. Lo, and P. Tu. A new algorithm for partial redundancy elimination based on SSA form. In Proceedings of the ACM SIGPLAN '97 Conf. on Prog. Language Design and Impl., pages 273-286, June 1997.
-
(1997)
Proceedings of the ACM SIGPLAN '97 Conf. on Prog. Language Design and Impl.
, pp. 273-286
-
-
Chow, F.1
Chan, S.2
Kennedy, R.3
Liu, S.-M.4
Lo, R.5
Tu, P.6
-
13
-
-
85050550846
-
Abstract intrepretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints
-
January
-
P. Cousot and R. Cousot. Abstract intrepretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the 4th ACM Symposium on Principles of Programming Languages, pages 238-252, January 1977.
-
(1977)
Conference Record of the 4th ACM Symposium on Principles of Programming Languages
, pp. 238-252
-
-
Cousot, P.1
Cousot, R.2
-
15
-
-
84976800698
-
Practical adaptation of the global optimization algorithm of Morel and Renvoise
-
April
-
Dhananjay M. Dhamdhere. Practical adaptation of the global optimization algorithm of Morel and Renvoise. ACM Transactions on Programming Languages and Systems, 13(2):291-294, April 1991.
-
(1991)
ACM Transactions on Programming Languages and Systems
, vol.13
, Issue.2
, pp. 291-294
-
-
Dhamdhere, D.M.1
-
16
-
-
84976860830
-
A solution to a problem with Morel and Renvoise's "global optimization by suppression of partial redundancies"
-
October
-
K. Drechsler and M. Stadel. A solution to a problem with Morel and Renvoise's "global optimization by suppression of partial redundancies". ACM Transactions on Programming Languages and Systems, 10(4):635-640, October 1988.
-
(1988)
ACM Transactions on Programming Languages and Systems
, vol.10
, Issue.4
, pp. 635-640
-
-
Drechsler, K.1
Stadel, M.2
-
17
-
-
84976852913
-
A variation of Knoop, Rüthing, and Steffen's lazy code motion
-
May
-
K. Drechsler and M. Stadel. A variation of Knoop, Rüthing, and Steffen's lazy code motion. ACM SIGPLAN Notices, 28(5):635-640, May 1993.
-
(1993)
ACM SIGPLAN Notices
, vol.28
, Issue.5
, pp. 635-640
-
-
Drechsler, K.1
Stadel, M.2
-
18
-
-
0031269332
-
A practical framework for demand-driven interprocedural data flow analysis
-
November
-
Evelyn Duesterwald, Rajiv Gupta, and Mary Lou Soffa. A practical framework for demand-driven interprocedural data flow analysis. ACM Transactions on Programming Languages and Systems, 19(6):992-1030, November 1997.
-
(1997)
ACM Transactions on Programming Languages and Systems
, vol.19
, Issue.6
, pp. 992-1030
-
-
Duesterwald, E.1
Gupta, R.2
Soffa, M.L.3
-
23
-
-
84957689064
-
Controlled node splitting
-
Sweden, April
-
Johan Janssen and Henk Corporaal. Controlled node splitting. In Compiler Construction, 6th International Conference, volume 1060 of Springer Lecture Notes in Computer Science, pages 44-58, Sweden, April 1996.
-
(1996)
Compiler Construction, 6th International Conference, Volume 1060 of Springer Lecture Notes in Computer Science
, vol.1060
, pp. 44-58
-
-
Janssen, J.1
Corporaal, H.2
-
24
-
-
0028460367
-
Optimal code motion: Theory and practice
-
Jens Knoop, Oliver Rüthing, and Bernhard Steffen. Optimal code motion: Theory and practice. ACM Trans. on Progr. Languages and Systems, 16(4):1117-1155, 1994.
-
(1994)
ACM Trans. on Progr. Languages and Systems
, vol.16
, Issue.4
, pp. 1117-1155
-
-
Knoop, J.1
Rüthing, O.2
Steffen, B.3
-
25
-
-
0027695220
-
Sentinel scheduling for VLIW and superscalar processors
-
S. A. Mahlke, W. Y. Chen, R. A. Bringmann, R. E. Hank, W.M. W. Hwu, B. R. Rau, and M. S. Schlansker. Sentinel scheduling for VLIW and superscalar processors. ACM Transactions on Computer Systems, 11(4):376-408, 1993.
-
(1993)
ACM Transactions on Computer Systems
, vol.11
, Issue.4
, pp. 376-408
-
-
Mahlke, S.A.1
Chen, W.Y.2
Bringmann, R.A.3
Hank, R.E.4
Hwu, W.M.W.5
Rau, B.R.6
Schlansker, M.S.7
-
26
-
-
0018434045
-
Global optimization by supression of partial redundancies
-
E. Morel and C. Renviose. Global optimization by supression of partial redundancies. CACM, 22(2):96-103, 1979.
-
(1979)
CACM
, vol.22
, Issue.2
, pp. 96-103
-
-
Morel, E.1
Renviose, C.2
-
28
-
-
0022787552
-
Elimination algorithms for data flow analysis
-
September
-
Barbara G. Ryder and Marvin C. Paull. Elimination algorithms for data flow analysis. ACM Computing Surveys, 18(3):277-316, September 1986.
-
(1986)
ACM Computing Surveys
, vol.18
, Issue.3
, pp. 277-316
-
-
Ryder, B.G.1
Paull, M.C.2
-
29
-
-
0030263395
-
Precise interprocedural dataflow analysis with applications to constant propagation
-
Mooly Sagiv, Thomas Reps, and Susan Horwitz. Precise interprocedural dataflow analysis with applications to constant propagation. Theoretical Computer Science, 167(1-2):131-170, 1996.
-
(1996)
Theoretical Computer Science
, vol.167
, Issue.1-2
, pp. 131-170
-
-
Sagiv, M.1
Reps, T.2
Horwitz, S.3
|