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)
Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01)
Related Items
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
