Fast algorithms for the elimination of common subexpressions

DOI10.1007/BF00289078zbMath0287.68019MaRDI QIDQ1846330

Jeffrey D. Ullman

Publication date: 1973

Published in: Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01)

Related Items (17)

Efficient symbolic analysis of programs ⋮ A two-machine flow shop scheduling problem with controllable job processing times ⋮ Iterative methods of program analysis ⋮ Pathlistings applied to data flow analysis ⋮ Applications of graph theory in computer systems ⋮ Using powerdomains to generalize relational databases ⋮ An \(O(n)\) algorithm for computing the set of available expressions of D-charts ⋮ Testing flow graph reducibility ⋮ Node listings for reducible flow graphs ⋮ Profitability computations on program flow graphs ⋮ Finding the depth of a flow graph ⋮ Monotone data flow analysis frameworks ⋮ Closed sets and translations of relation schemes ⋮ Nonapplicable nulls ⋮ On equivalence of relational and network database models ⋮ A region analysis algorithm for the live variables problem ⋮ On sparse evaluation representations

Cites Work

• A global flow analysis algorithm
• Flow Graph Reducibility
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast algorithms for the elimination of common subexpressions