On the public citation graph
Dataflow-based pruning for speeding up superoptimization
0 signed · 43 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/11916277_38openalex-snapshot
To Ackermann-ize or Not to Ackermann-ize? On Efficiently Handling Uninterpreted Function Symbols in $\mathit{SMT}(\mathcal{EUF} \cup \mathcal{T})$
inferredcites →https://doi.org/10.1007/978-3-319-21668-3_10openalex-snapshot
Synthesis Through Unification
inferredcites →https://doi.org/10.1007/978-3-662-54577-5_18openalex-snapshot
Scaling Enumerative Program Synthesis via Divide and Conquer
inferredcites →https://doi.org/10.1109/tvcg.2014.2346248openalex-snapshot
UpSet: Visualization of Intersecting Sets
inferredcites →https://doi.org/10.1145/1168918.1168906openalex-snapshot
Automatic generation of peephole superoptimizers
inferredcites →https://doi.org/10.1145/1993316.1993506openalex-snapshot
Synthesis of loop-free programs
inferredcites →https://doi.org/10.1145/1993316.1993532openalex-snapshot
Finding and understanding bugs in C compilers
inferredcites →https://doi.org/10.1145/2442516.2442529openalex-snapshot
From relational verification to SIMD loop synthesis
inferredcites →https://doi.org/10.1145/2568225.2568250openalex-snapshot
CodeHint: dynamic and interactive synthesis of code snippets
inferredcites →https://doi.org/10.1145/2737924.2737960openalex-snapshot
Synthesis of machine code from semantics
inferredcites →https://doi.org/10.1145/2837614.2837666openalex-snapshot
Optimizing synthesis with metasketches
inferredcites →https://doi.org/10.1145/2983990.2984006openalex-snapshot
Speeding up machine-code synthesis
inferredcites →https://doi.org/10.1145/3062341.3062343openalex-snapshot
Taming undefined behavior in LLVM
inferredcites →https://doi.org/10.1145/3180155.3180211openalex-snapshot
Generalized data structure synthesis
inferredcites →https://doi.org/10.1145/3192366.3192410openalex-snapshot
Accelerating search-based program synthesis using learned probabilistic models
inferredcites →https://doi.org/10.1145/3290385openalex-snapshot
Structuring the synthesis of heap-manipulating programs
inferredcites →https://doi.org/10.1145/3371080openalex-snapshot
Program synthesis by type-guided abstraction refinement
inferredcites →https://doi.org/10.1145/36177.36194openalex-snapshot
Superoptimizer: a look at the smallest program
inferredcites →https://doi.org/10.23919/fmcad.2019.8894267openalex-snapshot
Extending enumerative function synthesis via SMT-driven classification
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-37709-9_12openalex-snapshot
Verifying the Verifier: eBPF Range Analysis Verification
inferred← citeshttps://doi.org/10.1016/j.infsof.2025.107800openalex-snapshot
Neural-guided superoptimization in ethereum
inferred← citeshttps://doi.org/10.1016/j.jss.2024.112284openalex-snapshot
Harnessing heap analysis for the synthesis of superoptimized bytecode
inferred← citeshttps://doi.org/10.1109/cgo53902.2022.9741267openalex-snapshot
Sound, Precise, and Fast Abstract Interpretation with Tristate Numbers
inferred← citeshttps://doi.org/10.1109/tnet.2023.3346286openalex-snapshot
Morpheus: A Run Time Compiler and Optimizer for Software Data Planes
inferred← citeshttps://doi.org/10.1145/3452296.3472929openalex-snapshot
Synthesizing safe and efficient kernel extensions for packet processing
inferred← citeshttps://doi.org/10.1145/3503222.3507769openalex-snapshot
Domain specific run time optimization for software data planes
inferred← citeshttps://doi.org/10.1145/3506800openalex-snapshot
Super-optimization of Smart Contracts
inferred← citeshttps://doi.org/10.1145/3591288openalex-snapshot
Inductive Program Synthesis via Iterative Forward-Backward Abstract Interpretation
inferred← citeshttps://doi.org/10.1145/3617232.3624862openalex-snapshot
Lightweight, Modular Verification for WebAssembly-to-Native Instruction Selection
inferred← citeshttps://doi.org/10.1145/3632858openalex-snapshot
Optimal Program Synthesis via Abstract Interpretation
inferred← citeshttps://doi.org/10.1145/3649837openalex-snapshot
Hydra: Generalizing Peephole Optimizations with Program Synthesis
inferred← citeshttps://doi.org/10.1145/3656435openalex-snapshot
SuperStack: Superoptimization of Stack-Bytecode via Greedy, Constraint-Based, and SAT Techniques
inferred← citeshttps://doi.org/10.1145/3669940.3707240openalex-snapshot
Optimizing Quantum Circuits, Fast and Slow
inferred← citeshttps://doi.org/10.1145/3691620.3695369openalex-snapshot
Efficient Code Causes Inefficiency in Compiler Optimizations
inferred← citeshttps://doi.org/10.1145/3691620.3695548openalex-snapshot
Shoot Yourself in the Foot — Efficient Code Causes Inefficiency in Compiler Optimizations
inferred← citeshttps://doi.org/10.1145/3763102openalex-snapshot
Active Learning for Neurosymbolic Program Synthesis
inferred← citeshttps://doi.org/10.1145/3776694openalex-snapshot
Inductive Program Synthesis by Meta-Analysis-Guided Hole Filling
inferred← citeshttps://doi.org/10.48550/arxiv.2106.08833openalex-snapshot
Dynamic Recompilation of Software Network Services with Morpheus
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.