Expansion-Based Removal of Semantic Partial Redundancies
- 1 January 1999
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Complete removal of redundant expressionsACM SIGPLAN Notices, 1998
- Code motion and code placement: Just synonyms?Published by Springer Nature ,1998
- Global code motion/global value numberingACM SIGPLAN Notices, 1995
- The power of assignment motionACM SIGPLAN Notices, 1995
- Efficiently computing static single assignment form and the control dependence graphACM Transactions on Programming Languages and Systems, 1991
- An approach to ordering optimizing transformationsACM SIGPLAN Notices, 1990
- Optimal run time optimization proved by a new look at abstract interpretationsLecture Notes in Computer Science, 1987
- Global optimization by suppression of partial redundanciesCommunications of the ACM, 1979
- An algorithm for reduction of operator strengthCommunications of the ACM, 1977
- Monotone data flow analysis frameworksActa Informatica, 1977