Partial redundancy elimination is not bidirectional

Authors:
Michael Wolfe
Affiliations:
The Portland Group, Inc., USA
Venue:
ACM SIGPLAN Notices
Year:
1999

Citing 3
Cited 3

A fast algorithm for code movement optimisation

ACM SIGPLAN Notices
Lazy code motion

PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
Global optimization by suppression of partial redundancies

Communications of the ACM

E-path_PRE: partial redundancy elimination made easy

ACM SIGPLAN Notices
Fast profile-based partial redundancy elimination

JMLC'06 Proceedings of the 7th joint conference on Modular Programming Languages
Bidirectional data flow analysis for type inferencing

Computer Languages, Systems and Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract