Global optimization by suppression of partial redundancies
From MaRDI portal
Publication:4174701
DOI10.1145/359060.359069zbMATH Open0393.68010OpenAlexW2087086761MaRDI QIDQ4174701FDOQ4174701
Authors: É. Morel, C. Renvoise 
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
Cited In (14)
- Partial redundancy elimination for access path expressions
- Pre-synthesis Optimization for Asynchronous Circuits Using Compiler Techniques
- Quality engineering: leveraging heterogeneous information (invited talk)
- Proof optimization for partial redundancy elimination
- Generative program analysis and beyond: the power of domain-specific languages (invited paper)
- A composite hoisting-strength reduction transformation for global program optimization part I
- A higher-order strategy for eliminating common subexpressions
- Properties of data flow frameworks: A unified model
- A composite algorithm for strength reduction and code movement optimization
- Data flow analysis as model checking
- Bidirectional data flow analysis for type inferencing.
- A composite hoisting-strength reduction transformation for global program optimization part ii
- Property-oriented expansion
- Combining model checking and data-flow analysis
This page was built for publication: Global optimization by suppression of partial redundancies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4174701)
