On the public citation graph

Basic-block graphs: Living dinosaurs?

https://doi.org/10.1007/bfb0026423
0 signed · 32 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-60630-0_13openalex-snapshot
Parallelism for free: Bitvector analyses ⇒ no state explosion!
inferredcites →https://doi.org/10.1007/978-3-662-01089-1_1openalex-snapshot
Invariance of Approximative Semantics with Respect to Program Transformations
inferredcites →https://doi.org/10.1007/bf00282621openalex-snapshot
An efficient general iterative algorithm for dataflow analysis
inferredcites →https://doi.org/10.1007/bf01237234openalex-snapshot
Properties of data flow frameworks
inferredcites →https://doi.org/10.1080/00207168808803702openalex-snapshot
A new algorithm for composite hoisting and strength reduction optimisation
inferredcites →https://doi.org/10.1080/00207168908803704openalex-snapshot
Corrigendum: a new algorithm for composite hoisting and strength reduction optimisation
inferredcites →https://doi.org/10.1145/143095.143120openalex-snapshot
Sharlit---a tool for building optimizers
inferredcites →https://doi.org/10.1145/143095.143135openalex-snapshot
How to analyze large programs efficiently and informatively
inferredcites →https://doi.org/10.1145/143103.143135openalex-snapshot
How to analyze large programs efficiently and informatively
inferredcites →https://doi.org/10.1145/178243.178256openalex-snapshot
Partial dead code elimination
inferredcites →https://doi.org/10.1145/183432.183443openalex-snapshot
Optimal code motion
inferredcites →https://doi.org/10.1145/201059.201061openalex-snapshot
Combining analyses, combining optimizations
inferredcites →https://doi.org/10.1145/359060.359069openalex-snapshot
Global optimization by suppression of partial redundancies
inferredcites →https://doi.org/10.1145/359863.359888openalex-snapshot
An algorithm for reduction of operator strength
inferredcites →https://doi.org/10.1145/512927.512945openalex-snapshot
A unified approach to global program optimization
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/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-44905-1_18openalex-snapshot
A Precise Fixpoint Reaching Definition Analysis for Arrays
inferred← citeshttps://doi.org/10.1007/3-540-45937-5_6openalex-snapshot
A Graph—Free Approach to Data—Flow Analysis
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-49059-0_25openalex-snapshot
From DFA-Frameworks to DFA-Generators: A Unifying Multiparadigm Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-28869-2_3openalex-snapshot
A Formally Verified SSA-Based Middle-End
inferred← citeshttps://doi.org/10.1007/bfb0053569openalex-snapshot
Code motion and code placement: Just synonyms?
inferred← citeshttps://doi.org/10.1007/s10817-009-9155-4openalex-snapshot
A Formally Verified Compiler Back-end
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.11.042openalex-snapshot
An Applicative Control-Flow Graph Based on Huet's Zipper
inferred← citeshttps://doi.org/10.1145/1111037.1111042openalex-snapshot
Formal certification of a compiler back-end or
inferred← citeshttps://doi.org/10.1145/1111320.1111042openalex-snapshot
Formal certification of a compiler back-end or
inferred← citeshttps://doi.org/10.1145/2579080openalex-snapshot
Formal Verification of an SSA-Based Middle-End for CompCert
inferred← citeshttps://doi.org/10.1145/3797874openalex-snapshot
Denotation-based Compositional Compiler Verification
inferred← citeshttps://doi.org/10.5555/638476.638508openalex-snapshot
An open framework for data-flow analysis in Java: extended abstract
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.