Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 3, 1972 - Issue 1-4
Submit an article Journal homepage
18
Views
15
CrossRef citations to date
0
Altmetric
Original Articles

Safety of code motion

Ken Kennedy Rice University, Houston, Texas, USA
Pages 117-130 | Published online: 21 Dec 2010

Citations (15)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (1)

D.M. Dhamdhere. (1989) A new algorithm for composite hoisting and strength reduction optimisation. International Journal of Computer Mathematics 27:1, pages 1-14.
Read now

Articles from other publishers (14)

Rhodes H. F. Brown & R. Nigel Horspool. (2010) Local redundant polymorphism query elimination. Local redundant polymorphism query elimination.
Jong-Soo Park & Jae-Jin Lee. (2008) A Practical Improvement to the Partial Redundancy Elimination in SSA Form. Journal of Computing Science and Engineering 2:3, pages 301-320.
Crossref
Jingling Xue & Qiong Cai. (2006) A lifetime optimal algorithm for speculative PRE. ACM Transactions on Architecture and Code Optimization 3:2, pages 115-155.
Crossref
Qiong Cai & Jingling Xue. (2003) Optimal and efficient speculation-based partial redundancy elimination. Optimal and efficient speculation-based partial redundancy elimination.
Dhananjay M. Dhamdhere. (2002) E-path_PRE. ACM SIGPLAN Notices 37:8, pages 53-65.
Crossref
Robert Kennedy, Sun Chan, Shin-Ming Liu, Raymond Lo, Peng Tu & Fred Chow. (1999) Partial redundancy elimination in SSA form. ACM Transactions on Programming Languages and Systems 21:3, pages 627-676.
Crossref
R.N. Horspool & H.C. Ho. (1997) Partial redundancy elimination driven by a cost-benefit analysis. Partial redundancy elimination driven by a cost-benefit analysis.
Uday P. Khedker & Dhananjay M. Dhamdhere. (1994) A generalized theory of bit vector data flow analysis. ACM Transactions on Programming Languages and Systems 16:5, pages 1472-1511.
Crossref
David Bernstein, Michael Rodeh & Mooly Sagiv. 1992. ESOP '92. ESOP '92 56 72 .
D.M. Dhamdhere. (1990) A usually linear algorithm for register assignment using edge placement of load and store instructions. Computer Languages 15:2, pages 83-94.
Crossref
D.M. Dhamdhere & J.S. Keith. (1983) Characterization of program loops in code optimization. Computer Languages 8:2, pages 69-76.
Crossref
Jayashree Ramanathan & Ken Kennedy. (1981) Pathlistings applied to data flow analysis. Acta Informatica 16:3, pages 253-273.
Crossref
John H. Crawford & Mehdi Jazayeri. (1980) A new approach to code motion and its application to hoisting. Computer Languages 5:1, pages 29-36.
Crossref
John Cocke & Ken Kennedy. (1977) An algorithm for reduction of operator strength. Communications of the ACM 20:11, pages 850-856.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.