Global optimization by suppression of partial redundancies

DOI10.1145/359060.359069zbMath0393.68010OpenAlexW2087086761MaRDI QIDQ4174701

C. Renvoise, É. Morel

Publication date: 1979

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/359060.359069

zbMATH Keywords

LoopGlobal OptimizationCompilerPartial RedundanciesRedundant Computations

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items (14)

Partial redundancy elimination for access path expressions ⋮ Proof optimization for partial redundancy elimination ⋮ Combining Model Checking and Data-Flow Analysis ⋮ Data flow analysis as model checking ⋮ Bidirectional data flow analysis for type inferencing. ⋮ Properties of data flow frameworks: A unified model ⋮ Generative program analysis and beyond: the power of domain-specific languages (invited paper) ⋮ A higher-order strategy for eliminating common subexpressions ⋮ A composite algorithm for strength reduction and code movement optimization ⋮ Quality Engineering: Leveraging Heterogeneous Information ⋮ Pre-synthesis Optimization for Asynchronous Circuits Using Compiler Techniques ⋮ A composite hoisting-strength reduction transformation for global program optimization part I ⋮ A composite hoisting-strength reduction transformation for global program optimization part ii ⋮ Property-oriented expansion

This page was built for publication: Global optimization by suppression of partial redundancies