On the public citation graph

Optimal control dependence computation and the Roman chariots problem

0 signed · 60 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/bf00881901openalex-snapshot
Bounded-overhead caching for definite-clause theorem proving
inferredcites →https://doi.org/10.1038/218019a0openalex-snapshot
“Memo” Functions and Machine Learning
inferredcites →https://doi.org/10.1109/tc.1981.1675827openalex-snapshot
Trace Scheduling: A Technique for Global Microcode Compaction
inferredcites →https://doi.org/10.1137/0215051openalex-snapshot
Filtering Search: A New Approach to Query-Answering
inferredcites →https://doi.org/10.1145/113445.113466openalex-snapshot
Global instruction scheduling for superscalar machines
inferredcites →https://doi.org/10.1145/115372.115320openalex-snapshot
Efficiently computing static single assignment form and the control dependence graph
inferredcites →https://doi.org/10.1145/155090.155098openalex-snapshot
Dependence-based program analysis
inferredcites →https://doi.org/10.1145/176454.176456openalex-snapshot
What's in a region?
inferredcites →https://doi.org/10.1145/178243.178258openalex-snapshot
The program structure tree
inferredcites →https://doi.org/10.1145/207110.207114openalex-snapshot
APT
inferredcites →https://doi.org/10.1145/22145.22166openalex-snapshot
A linear algorithm for finding dominators in flow graphs and related problems
inferredcites →https://doi.org/10.1145/231379.231435openalex-snapshot
A framework for generalized control dependence
inferredcites →https://doi.org/10.1145/24039.24041openalex-snapshot
The program dependence graph and its use in optimization
inferredcites →https://doi.org/10.1145/357062.357071openalex-snapshot
A fast algorithm for finding dominators in a flowgraph
inferredcites →https://doi.org/10.1145/55364.55385openalex-snapshot
A framework for determining useful parallelism
inferredcites →https://doi.org/10.1145/65979.65980openalex-snapshot
Integrating noninterfering versions of programs
inferredcites →https://doi.org/10.1145/73560.73572openalex-snapshot
Integrating non-intering versions of programs
inferredcites →https://doi.org/10.1145/93542.93592openalex-snapshot
Compact representations for control dependence
inferredcites →https://doi.org/10.1145/97444.97702openalex-snapshot
A foundation for sequentializing parallel code

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-62592-5_55openalex-snapshot
Algorithms and data structures for control dependence and related compiler problems
inferred← citeshttps://doi.org/10.1007/978-3-030-65474-0_10openalex-snapshot
Simple and Efficient Computation of Minimal Weak Control Closure
inferred← citeshttps://doi.org/10.1007/978-3-030-80515-9_13openalex-snapshot
Static Single Information Form
inferred← citeshttps://doi.org/10.1007/978-3-540-71229-9_6openalex-snapshot
Correcting the Dynamic Call Graph Using Control-Flow Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-02737-6_12openalex-snapshot
Traces of Control-Flow Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-54807-9_2openalex-snapshot
Parameterized Construction of Program Representations for Sparse Dataflow Analyses
inferred← citeshttps://doi.org/10.1016/j.cl.2009.04.001openalex-snapshot
The dependence condition graph: Precise conditions for dependence between program points
inferred← citeshttps://doi.org/10.1016/j.cl.2014.05.001openalex-snapshot
A sparse evaluation technique for detailed semantic analyses
inferred← citeshttps://doi.org/10.1016/j.jss.2021.111140openalex-snapshot
Efficient computation of minimal weak and strong control closure
inferred← citeshttps://doi.org/10.1016/j.scico.2009.11.001openalex-snapshot
Combining dynamic and static slicing for analysing assembler
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00315-7openalex-snapshot
On sparse evaluation representations
inferred← citeshttps://doi.org/10.1093/nar/gks1026openalex-snapshot
DiffSplice: the genome-wide detection of differential splicing events with RNA-seq
inferred← citeshttps://doi.org/10.1109/cmpsac.2002.1045029openalex-snapshot
Program slicing via FermaT transformations
inferred← citeshttps://doi.org/10.1109/icsm.2001.972783openalex-snapshot
The FermaT assembler re-engineering workbench
inferred← citeshttps://doi.org/10.1109/icsm.2004.1357800openalex-snapshot
Legacy assembler reengineering and migration
inferred← citeshttps://doi.org/10.1109/icsme.2014.82openalex-snapshot
Program Slicing in the Presence of Preprocessor Variability
inferred← citeshttps://doi.org/10.1109/rtss.2012.88openalex-snapshot
Reducing the Size of the Constraint Model in Implicit Path Enumeration Using Super Blocks
inferred← citeshttps://doi.org/10.1109/scam.2009.12openalex-snapshot
Properties of Slicing Definitions
inferred← citeshttps://doi.org/10.1109/tse.2006.60openalex-snapshot
Using SCL to specify and check design intent in source code
inferred← citeshttps://doi.org/10.1109/tse.2010.13openalex-snapshot
Deriving a Slicing Algorithm via FermaT Transformations
inferred← citeshttps://doi.org/10.1145/1216374.1216375openalex-snapshot
Slicing as a program transformation
inferred← citeshttps://doi.org/10.1145/1390630.1390644openalex-snapshot
Customization change impact analysis for erp professionals via program slicing
inferred← citeshttps://doi.org/10.1145/2254064.2254092openalex-snapshot
Design and implementation of sparse global analyses for C-like languages
inferred← citeshttps://doi.org/10.1145/271771.271780openalex-snapshot
Computation of interprocedural control dependence
inferred← citeshttps://doi.org/10.1145/271775.271780openalex-snapshot
Computation of interprocedural control dependence
inferred← citeshttps://doi.org/10.1145/2810103.2813684openalex-snapshot
Inlined Information Flow Monitoring for JavaScript
inferred← citeshttps://doi.org/10.1145/2892208.2892230openalex-snapshot
Sparse representation of implicit flows with applications to side-channel detection
inferred← citeshttps://doi.org/10.1145/295656.295663openalex-snapshot
A new, simpler linear-time dominators algorithm
inferred← citeshttps://doi.org/10.1145/2983990.2984015openalex-snapshot
A compiler for throughput optimization of graph algorithms on GPUs
inferred← citeshttps://doi.org/10.1145/3022671.2984015openalex-snapshot
A compiler for throughput optimization of graph algorithms on GPUs
inferred← citeshttps://doi.org/10.1145/316158.316166openalex-snapshot
Efficient coverage testing using global dominator graphs
inferred← citeshttps://doi.org/10.1145/3434489openalex-snapshot
Semantic Correctness of Dependence-based Slicing for Interprocedural, Possibly Nonterminating Programs
inferred← citeshttps://doi.org/10.1145/349299.349318openalex-snapshot
Optimal instruction scheduling using integer programming
inferred← citeshttps://doi.org/10.1145/349299.349330openalex-snapshot
On loops, dominators, and dominance frontier
inferred← citeshttps://doi.org/10.1145/358438.349318openalex-snapshot
Optimal instruction scheduling using integer programming
inferred← citeshttps://doi.org/10.1145/358438.349330openalex-snapshot
On loops, dominators, and dominance frontier
inferred← citeshttps://doi.org/10.1145/367008.367022openalex-snapshot
Interprocedural control dependence
inferred← citeshttps://doi.org/10.1145/381788.316166openalex-snapshot
Efficient coverage testing using global dominator graphs
inferred← citeshttps://doi.org/10.1145/570886.570887openalex-snapshot
On loops, dominators, and dominance frontiers
inferred← citeshttps://doi.org/10.1145/765568.765573openalex-snapshot
Algorithms for computing the static single assignment form
inferred← citeshttps://doi.org/10.4995/thesis/10251/193146openalex-snapshot
Analysis Techniques for Software Maintenance
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.