On the public citation graph

Code motion and code placement: Just synonyms?

https://doi.org/10.1007/bfb0053569
0 signed · 35 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-52592-0_76openalex-snapshot
The value flow graph: A program representation for optimal program transformations
inferredcites →https://doi.org/10.1007/3-540-61739-6_31openalex-snapshot
Property-oriented expansion
inferredcites →https://doi.org/10.1007/3540539816_78openalex-snapshot
Efficient code motion and an adaption to strength reduction
inferredcites →https://doi.org/10.1007/bfb0026423openalex-snapshot
Basic-block graphs: Living dinosaurs?
inferredcites →https://doi.org/10.1145/103135.214520openalex-snapshot
Practical adaption of the global optimization algorithm of Morel and Renvoise
inferredcites →https://doi.org/10.1145/143095.143135openalex-snapshot
How to analyze large programs efficiently and informatively
inferredcites →https://doi.org/10.1145/143095.143136openalex-snapshot
Lazy code motion
inferredcites →https://doi.org/10.1145/143103.143135openalex-snapshot
How to analyze large programs efficiently and informatively
inferredcites →https://doi.org/10.1145/143103.143136openalex-snapshot
Lazy code motion
inferredcites →https://doi.org/10.1145/183432.183443openalex-snapshot
Optimal code motion
inferredcites →https://doi.org/10.1145/207110.207154openalex-snapshot
Global code motion/global value numbering
inferredcites →https://doi.org/10.1145/223428.207154openalex-snapshot
Global code motion/global value numbering
inferredcites →https://doi.org/10.1145/359060.359069openalex-snapshot
Global optimization by suppression of partial redundancies
inferredcites →https://doi.org/10.1145/48022.214509openalex-snapshot
A solution to a problem with Morel and Renvoise's “Global optimization by suppression of partial redundancies”
inferredcites →https://doi.org/10.1145/512927.512945openalex-snapshot
A unified approach to global program optimization
inferredcites →https://doi.org/10.1145/512950.512961openalex-snapshot
Symbolic evaluation and the global value graph
inferredcites →https://doi.org/10.1145/512976.512977openalex-snapshot
Application of lattice algebra to loop optimization
inferredcites →https://doi.org/10.1145/51607.51621openalex-snapshot
A fast algorithm for code movement optimisation
inferredcites →https://doi.org/10.1145/69558.214513openalex-snapshot
Some comments on “A solution to a problem with Morel and Renvoise's 'Global optimization by suppression of partial redundancies'”
inferredcites →https://doi.org/10.1145/73560.73561openalex-snapshot
Detecting equality of variables in programs
inferredcites →https://doi.org/10.1145/73560.73562openalex-snapshot
Global value numbers and redundant computations

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-48092-7_13openalex-snapshot
Optimization Under the Perspective of Soundness, Completeness, and Reusability
inferred← citeshttps://doi.org/10.1007/3-540-48294-6_15openalex-snapshot
Detecting Equalities of Variables: Combining Efficiency with Precision
inferred← citeshttps://doi.org/10.1007/3-540-48319-5_22openalex-snapshot
The Advantages of Instance-Wise Reaching Definition Analyses in Array (S)SA
inferred← citeshttps://doi.org/10.1007/978-3-540-24723-4_12openalex-snapshot
Value-Based Partial Redundancy Elimination
inferred← citeshttps://doi.org/10.1007/978-3-540-30579-8_6openalex-snapshot
Checking Herbrand Equalities and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-540-31987-0_4openalex-snapshot
Interprocedural Herbrand Equalities
inferred← citeshttps://doi.org/10.1007/978-3-540-45099-3_14openalex-snapshot
Partial Redundancy Elimination on Predicated Code
inferred← citeshttps://doi.org/10.1007/978-3-540-49051-7_7openalex-snapshot
Expansion-Based Removal of Semantic Partial Redundancies
inferred← citeshttps://doi.org/10.1007/bfb0053558openalex-snapshot
Programming languages and systems : 7th European Symposium on Programming, ESOP '98, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS '98, Lisbon, Portugal, March 28-April 4, 1998 : proceedings
inferred← citeshttps://doi.org/10.1016/s0167-6423(00)00016-2openalex-snapshot
Code motion in the presence of critical edges without bidirectional data flow analysis
inferred← citeshttps://doi.org/10.1109/korus.2004.1555271openalex-snapshot
Modification of the ssapre algorithm for semantic code motion
inferred← citeshttps://doi.org/10.1145/268946.268966openalex-snapshot
Path-sensitive value-flow analysis
inferred← citeshttps://doi.org/10.1145/325694.325715openalex-snapshot
Sparse code motion
inferred← citeshttps://doi.org/10.4230/dagsemproc.08161.9openalex-snapshot
Value Flow Graph Analysis with SATIrE
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.