A usually linear algorithm for register assignment using edge placement of load and store instructions

An elimination algorithm for bidirectional data flow problems using edge placement

ACM Transactions on Programming Languages and Systems (TOPLAS)

Partial dead code elimination

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation

The power of assignment motion

PLDI '95 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation

Register promotion by sparse partial redundancy elimination of loads and stores

PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation

E-path_PRE: partial redundancy elimination made easy

ACM SIGPLAN Notices

Bidirectional Data Flow Analysis in Code Motion: Myth and Reality

SAS '98 Proceedings of the 5th International Symposium on Static Analysis