Fast algorithms for the elimination of common subexpressions
From MaRDI portal
Publication:1846330
DOI10.1007/BF00289078zbMath0287.68019MaRDI QIDQ1846330
Publication date: 1973
Published in: Acta Informatica (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68N01: General topics in the theory of software
Related Items
Closed sets and translations of relation schemes, A region analysis algorithm for the live variables problem, On equivalence of relational and network database models, Efficient symbolic analysis of programs, A two-machine flow shop scheduling problem with controllable job processing times, Pathlistings applied to data flow analysis, 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, On sparse evaluation representations, Nonapplicable nulls, Iterative methods of program analysis, Applications of graph theory in computer systems
Cites Work