On the public citation graph
Verifying and improving Halide’s term rewriting system with program synthesis
0 signed · 46 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/978-3-319-52234-0_18openalex-snapshot
Solving Nonlinear Integer Arithmetic with MCSAT
inferredcites →https://doi.org/10.1007/978-3-319-73721-8_7openalex-snapshot
A Framework for Computer-Aided Design of Educational Domain Models
inferredcites →https://doi.org/10.1007/978-3-540-78800-3_24openalex-snapshot
Z3: An Efficient SMT Solver
inferredcites →https://doi.org/10.1007/978-3-642-10672-9_3openalex-snapshot
The Sketching Approach to Program Synthesis
inferredcites →https://doi.org/10.1007/978-3-642-54013-4_12openalex-snapshot
Weakest Precondition Synthesis for Compiler Optimizations
inferredcites →https://doi.org/10.1016/s0898-1221(98)90113-4openalex-snapshot
Term rewriting and all that
inferredcites →https://doi.org/10.1145/128861.128862openalex-snapshot
The Euclidean definition of the functions div and mod
inferredcites →https://doi.org/10.1145/1465482.1465513openalex-snapshot
Handling the growth by definition of mechanical languages
inferredcites →https://doi.org/10.1145/2594291.2594340openalex-snapshot
A lightweight symbolic virtual machine for solver-aided host languages
inferredcites →https://doi.org/10.1145/2666356.2594340openalex-snapshot
A lightweight symbolic virtual machine for solver-aided host languages
inferredcites →https://doi.org/10.1145/2737924.2737965openalex-snapshot
Provably correct peephole optimizations with alive
inferredcites →https://doi.org/10.1145/2737924.2737977openalex-snapshot
Synthesizing data structure transformations from input-output examples
inferredcites →https://doi.org/10.1145/3062341.3062372openalex-snapshot
Alive-Infer: data-driven precondition inference for peephole optimizations in LLVM
inferredcites →https://doi.org/10.1145/3102071.3102084openalex-snapshot
Synthesizing interpretable strategies for solving puzzle games
inferredcites →https://doi.org/10.1145/3306346.3322967openalex-snapshot
Learning to optimize halide with tree search and random programs
inferredcites →https://doi.org/10.1145/3314221.3314641openalex-snapshot
Learning stateful preconditions modulo a test generator
inferredcites →https://doi.org/10.1145/3385412.3385996openalex-snapshot
Optimizing homomorphic evaluation circuits by program synthesis and term rewriting
inferredcites →https://doi.org/10.1145/3410227openalex-snapshot
Software Artifact for: Achieving High-Performance the Functional Way - A Functional Pearl on Expressing High-Performance Optimizations as Rewrite Strategies
inferredcites →https://doi.org/10.1145/36177.36194openalex-snapshot
Superoptimizer: a look at the smallest program
inferredcites →https://doi.org/10.1145/567752.567778openalex-snapshot
Systematic design of program analysis frameworks
inferredcites →https://doi.org/10.5555/3077629.3077661openalex-snapshot
Swapper: a framework for automatic generation of formula simplifiers based on conditional rewrite rules
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-57256-2_4openalex-snapshot
$${\textsc {HaliVer}}$$: Deductive Verification and Scheduling Languages Join Forces
inferred← citeshttps://doi.org/10.1145/3453483.3454030openalex-snapshot
Alive2: bounded translation validation for LLVM
inferred← citeshttps://doi.org/10.1145/3460945.3464953openalex-snapshot
Pure tensor program rewriting via access patterns (representation pearl)
inferred← citeshttps://doi.org/10.1145/3485481openalex-snapshot
Synthesizing contracts correct modulo a test generator
inferred← citeshttps://doi.org/10.1145/3485496openalex-snapshot
Rewrite rule inference using equality saturation
inferred← citeshttps://doi.org/10.1145/3497776.3517781openalex-snapshot
Caviar: an e-graph based TRS for automatic code optimization
inferred← citeshttps://doi.org/10.1145/3617232.3624873openalex-snapshot
Automatic Generation of Vectorizing Compilers for Customizable Digital Signal Processors
inferred← citeshttps://doi.org/10.1145/3623278.3624768openalex-snapshot
Fast Instruction Selection for Fast Digital Signal Processing
inferred← citeshttps://doi.org/10.1145/3639051openalex-snapshot
Application-level Validation of Accelerator Designs Using a Formal Software/Hardware Interface
inferred← citeshttps://doi.org/10.1145/3639313openalex-snapshot
Dias: Dynamic Rewriting of Pandas Code
inferred← citeshttps://doi.org/10.1145/3669940.3707262openalex-snapshot
SmoothE: Differentiable E-Graph Extraction
inferred← citeshttps://doi.org/10.1145/3676642.3736118openalex-snapshot
Syno: Structured Synthesis for Neural Operators
inferred← citeshttps://doi.org/10.1145/3704865openalex-snapshot
TensorRight: Automated Verification of Tensor Graph Rewrites
inferred← citeshttps://doi.org/10.1145/3729309openalex-snapshot
First-Class Verification Dialects for MLIR
inferred← citeshttps://doi.org/10.1145/3771775.3786269openalex-snapshot
CHEHAB: Automatic Compiler Code Optimization for Fully Homomorphic Encryption
inferred← citeshttps://doi.org/10.1145/3776720openalex-snapshot
Generating Compilers for Qubit Mapping and Routing
inferred← citeshttps://doi.org/10.1145/3779212.3790138openalex-snapshot
CHEHAB RL: Learning to Optimize Fully Homomorphic Encryption Computations
inferred← citeshttps://doi.org/10.1145/3793656.3793689openalex-snapshot
TensorEgg: Formally Verifying Rewrite Rules and Applying Them to Tensor Programs
inferred← citeshttps://doi.org/10.1145/3808304openalex-snapshot
Verifying Array Properties in Pure Data-Parallel Programs
inferred← citeshttps://doi.org/10.1145/3816695openalex-snapshot
Simplifying Mixed Boolean-Arithmetic Obfuscation by Program Synthesis and Equality Saturation
inferred← citeshttps://doi.org/10.23919/date56975.2023.10137308openalex-snapshot
An Automated Verification Framework for HalideIR-Based Compiler Transformations
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.