On the public citation graph
Fast algorithms for the elimination of common subexpressions
0 signed · 103 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bfb0059695openalex-snapshot
Structure and meaning of elementary programs
inferredcites →https://doi.org/10.1080/00207167108803048openalex-snapshot
A global flow analysis algorithm
inferredcites →https://doi.org/10.1145/390013.808480openalex-snapshot
Global common subexpression elimination
inferredcites →https://doi.org/10.1145/512927.512946openalex-snapshot
Analysis of a simple algorithm global data flow problems
inferredcites →https://doi.org/10.1145/800125.804040openalex-snapshot
Testing flow graph reducibility
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/ecjc.4430770201openalex-snapshot
The structure of elimination‐type algorithms for a class of fixed‐point problems on graphs
inferred← citeshttps://doi.org/10.1002/spe.4380200203openalex-snapshot
Structured dataflow analysis for arrays and its use in an optimizing compiler
inferred← citeshttps://doi.org/10.1007/3-540-06786-8_286openalex-snapshot
Ein Verfahren zur Optimierung von System-Programmen
inferred← citeshttps://doi.org/10.1007/3-540-10291-4_5openalex-snapshot
Graph rewriting and automatic, machine-independent program optimization
inferred← citeshttps://doi.org/10.1007/3-540-46423-9_8openalex-snapshot
Simple Generation of Static Single-Assignment Form
inferred← citeshttps://doi.org/10.1007/978-3-642-19823-6_5openalex-snapshot
Data Flow Analysis In Software Reliability
inferred← citeshttps://doi.org/10.1007/978-3-7091-8596-4_7openalex-snapshot
Application of Graph Rewriting to Optimization and Parallelization of Programs
inferred← citeshttps://doi.org/10.1007/bf00264579openalex-snapshot
Computation and use of data flow information in optimizing compilers
inferred← citeshttps://doi.org/10.1007/bf00268137openalex-snapshot
An O(n) algorithm for computing the set of available expressions of D-charts
inferred← citeshttps://doi.org/10.1007/bf00289306openalex-snapshot
Pathlistings applied to data flow analysis
inferred← citeshttps://doi.org/10.1007/bf00290339openalex-snapshot
Monotone data flow analysis frameworks
inferred← citeshttps://doi.org/10.1007/bf00991069openalex-snapshot
Applications of graph theory in computer systems
inferred← citeshttps://doi.org/10.1007/bf01070122openalex-snapshot
Iterative methods of program analysis
inferred← citeshttps://doi.org/10.1007/bf02242267openalex-snapshot
A region analysis algorithm for the live variables problem
inferred← citeshttps://doi.org/10.1007/bfb0025715openalex-snapshot
A tutorial and bibliographical survey on graph grammars
inferred← citeshttps://doi.org/10.1007/bfb0032730openalex-snapshot
On sparse evaluation representations
inferred← citeshttps://doi.org/10.1016/0020-0190(86)90048-7openalex-snapshot
An algorithm for the derivation of codefinitions in computer programs
inferred← citeshttps://doi.org/10.1016/0022-0000(86)90031-0openalex-snapshot
Efficient symbolic analysis of programs
inferred← citeshttps://doi.org/10.1016/0096-0551(75)90015-6openalex-snapshot
Optimization of very high level languages—I
inferred← citeshttps://doi.org/10.1016/0164-1212(79)90007-4openalex-snapshot
ASSET: A life cycle verification and visibility system
inferred← citeshttps://doi.org/10.1016/0164-1212(91)90037-7openalex-snapshot
An investigation of the applicability of data usage analysis
inferred← citeshttps://doi.org/10.1016/0898-1221(76)90027-4openalex-snapshot
Profitability computations on program flow graphs
inferred← citeshttps://doi.org/10.1016/b978-0-12-141050-6.50006-4openalex-snapshot
GRAPH THEORY AND GAUSSIAN ELIMINATION
inferred← citeshttps://doi.org/10.1016/b978-0-12-815412-0.00015-2openalex-snapshot
Data-Flow Analysis
inferred← citeshttps://doi.org/10.1016/s0022-0000(74)80049-8openalex-snapshot
Testing flow graph reducibility
inferred← citeshttps://doi.org/10.1016/s0022-0000(76)80042-6openalex-snapshot
Node listings for reducible flow graphs
inferred← citeshttps://doi.org/10.1016/s0022-0000(77)80032-9openalex-snapshot
Finding the depth of a flow graph
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00315-7openalex-snapshot
On sparse evaluation representations
inferred← citeshttps://doi.org/10.1109/32.126773openalex-snapshot
A control-flow normalization algorithm and its complexity
inferred← citeshttps://doi.org/10.1109/32.58766openalex-snapshot
An incremental version of iterative data flow analysis
inferred← citeshttps://doi.org/10.1109/real.2000.896008openalex-snapshot
A formal method for providing temporal equivalence in binary-to-binary translation of real-time applications
inferred← citeshttps://doi.org/10.1109/sfcs.1976.17openalex-snapshot
Graph grammars and global program data flow analysis
inferred← citeshttps://doi.org/10.1109/sfcs.1976.7openalex-snapshot
Assignment commands and array structures
inferred← citeshttps://doi.org/10.1109/tse.1979.234184openalex-snapshot
Detection of Data Flow Anomaly Through Program Instrumentation
inferred← citeshttps://doi.org/10.1109/wcre.2001.957807openalex-snapshot
Node coarsening calculi for program slicing
inferred← citeshttps://doi.org/10.1137/0204044openalex-snapshot
A Simple Algorithm for Global Data Flow Analysis Problems
inferred← citeshttps://doi.org/10.1137/0205011openalex-snapshot
On Finding Lowest Common Ancestors in Trees
inferred← citeshttps://doi.org/10.1137/0205014openalex-snapshot
A Comparison of Two Algorithms for Global Data Flow Analysis
inferred← citeshttps://doi.org/10.1137/1020067openalex-snapshot
Complexity of Combinatorial Algorithms
inferred← citeshttps://doi.org/10.1145/1053417.1053419openalex-snapshot
Proceedings of the SIGNUM conference on the programming environment for development of numerical software
inferred← citeshttps://doi.org/10.1145/1053417.806431openalex-snapshot
Using tools for verification, documentation and testing
inferred← citeshttps://doi.org/10.1145/1075382.1075385openalex-snapshot
Interprocedural parallelization analysis in SUIF
inferred← citeshttps://doi.org/10.1145/143095.143120openalex-snapshot
Sharlit---a tool for building optimizers
inferred← citeshttps://doi.org/10.1145/143103.143120openalex-snapshot
Sharlit—a tool for building optimizers
inferred← citeshttps://doi.org/10.1145/161494.161501openalex-snapshot
Undecidability of static analysis
inferred← citeshttps://doi.org/10.1145/231379.231434openalex-snapshot
A new framework for exhaustive and incremental data flow analysis using DJ graphs
inferred← citeshttps://doi.org/10.1145/27632.27649openalex-snapshot
Elimination algorithms for data flow analysis
inferred← citeshttps://doi.org/10.1145/276393.278523openalex-snapshot
A new framework for elimination-based data flow analysis using DJ graphs
inferred← citeshttps://doi.org/10.1145/2837614.2837659openalex-snapshot
Newtonian program analysis via tensor product
inferred← citeshttps://doi.org/10.1145/2914770.2837659openalex-snapshot
Newtonian program analysis via tensor product
inferred← citeshttps://doi.org/10.1145/3024084openalex-snapshot
Newtonian Program Analysis via Tensor Product
inferred← citeshttps://doi.org/10.1145/321832.321835openalex-snapshot
Characterizations of Reducible Flow Graphs
inferred← citeshttps://doi.org/10.1145/321921.321938openalex-snapshot
Global Data Flow Analysis and Iterative Algorithms
inferred← citeshttps://doi.org/10.1145/321921.321939openalex-snapshot
A Fast and Usually Linear Algorithm for Global Flow Analysis
inferred← citeshttps://doi.org/10.1145/322017.322027openalex-snapshot
On Live-Dead Analysis for Global Data Flow Problems
inferred← citeshttps://doi.org/10.1145/322123.322135openalex-snapshot
Data Flow Analysis for Procedural Languages
inferred← citeshttps://doi.org/10.1145/322261.322272openalex-snapshot
A Unified Approach to Path Problems
inferred← citeshttps://doi.org/10.1145/322261.322273openalex-snapshot
Fast Algorithms for Solving Path Problems
inferred← citeshttps://doi.org/10.1145/356674.356676openalex-snapshot
Data Flow Analysis in Software Reliability
inferred← citeshttps://doi.org/10.1145/359863.359888openalex-snapshot
An algorithm for reduction of operator strength
inferred← citeshttps://doi.org/10.1145/3640337openalex-snapshot
ARCTURUS : Full Coverage Binary Similarity Analysis with Reachability-guided Emulation
inferred← citeshttps://doi.org/10.1145/42192.42193openalex-snapshot
Incremental data-flow analysis algorithms
inferred← citeshttps://doi.org/10.1145/502874.502888openalex-snapshot
Incremental data flow analysis in a structured program editor
inferred← citeshttps://doi.org/10.1145/502949.502888openalex-snapshot
Incremental data flow analysis in a structured program editor
inferred← citeshttps://doi.org/10.1145/512760.512767openalex-snapshot
Monoids for rapid data flow analysis
inferred← citeshttps://doi.org/10.1145/512927.512946openalex-snapshot
Analysis of a simple algorithm global data flow problems
inferred← citeshttps://doi.org/10.1145/512950.512955openalex-snapshot
Applications of high level control flow
inferred← citeshttps://doi.org/10.1145/512950.512956openalex-snapshot
Generalized common subexpressions in very high level languages
inferred← citeshttps://doi.org/10.1145/512950.512958openalex-snapshot
Applications of a graph grammar for program control flow analysis
inferred← citeshttps://doi.org/10.1145/512950.512961openalex-snapshot
Symbolic evaluation and the global value graph
inferred← citeshttps://doi.org/10.1145/512976.512977openalex-snapshot
Application of lattice algebra to loop optimization
inferred← citeshttps://doi.org/10.1145/512976.512978openalex-snapshot
Node listings applied to data flow analysis
inferred← citeshttps://doi.org/10.1145/512976.512979openalex-snapshot
A fast and usually linear algorithm for global flow analysis
inferred← citeshttps://doi.org/10.1145/78969.78963openalex-snapshot
An interval-based approach to exhaustive and incremental interprocedural data-flow analysis
inferred← citeshttps://doi.org/10.1145/800113.803639openalex-snapshot
Finding the depth of a flow graph
inferred← citeshttps://doi.org/10.1145/800116.803767openalex-snapshot
Node listings for reducible flow graphs
inferred← citeshttps://doi.org/10.1145/800125.804040openalex-snapshot
Testing flow graph reducibility
inferred← citeshttps://doi.org/10.1145/800125.804056openalex-snapshot
On finding lowest common ancestors in trees
inferred← citeshttps://doi.org/10.31274/rtd-180813-5907openalex-snapshot
The reduction of data dependencies in high level programs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.