On the public citation graph
Verified tensor-program optimization via high-level scheduling rewrites
0 signed · 48 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-030-51054-1_7openalex-snapshot
Extensible Extraction of Efficient Imperative Programs with Foreign Functions, Manually Managed Memory, and Proofs
inferredcites →https://doi.org/10.1007/978-3-540-69330-7_10openalex-snapshot
A Language for the Compact Representation of Multiple Program Versions
inferredcites →https://doi.org/10.1007/978-3-642-54833-8_3openalex-snapshot
An Array-Oriented Language with Static Rank Polymorphism
inferredcites →https://doi.org/10.1109/ipdps.2007.370637openalex-snapshot
POET: Parameterized Optimizations for Empirical Tuning
inferredcites →https://doi.org/10.1109/ipdps.2009.5161004openalex-snapshot
Annotation-based empirical performance tuning using Orio
inferredcites →https://doi.org/10.1109/sc.2012.71openalex-snapshot
Legion: Expressing locality and independence with logical regions
inferredcites →https://doi.org/10.1145/1926354.1926358openalex-snapshot
Accelerating Haskell array codes with multicore GPUs
inferredcites →https://doi.org/10.1145/2185520.2185528openalex-snapshot
Decoupling algorithms from schedules for easy optimization of image processing pipelines
inferredcites →https://doi.org/10.1145/2784731.2784754openalex-snapshot
Generating performance portable code using rewrite rules: from high-level functional expressions to high-performance OpenCL code
inferredcites →https://doi.org/10.1145/3062341.3062354openalex-snapshot
Futhark: purely functional GPU-programming with nested parallelism and in-place array updates
inferredcites →https://doi.org/10.1145/3197517.3201383openalex-snapshot
Differentiable programming for image processing and deep learning in halide
inferredcites →https://doi.org/10.1145/3276491openalex-snapshot
GraphIt: a high-performance graph DSL
inferredcites →https://doi.org/10.1145/3341686openalex-snapshot
Narcissus: correct-by-construction derivation of decoders and encoders from binary formats
inferredcites →https://doi.org/10.1145/3434318openalex-snapshot
A verified optimizer for Quantum circuits
inferredcites →https://doi.org/10.1145/3460945.3464953openalex-snapshot
Pure tensor program rewriting via access patterns (representation pearl)
inferredcites →https://doi.org/10.1145/3473593openalex-snapshot
Getting to the point: index sets and parallelism-preserving autodiff for pointful array programming
inferredcites →https://doi.org/10.1177/1094342007078442openalex-snapshot
Parallel Programmability and the Chapel Language
inferredcites →https://doi.org/10.1177/1094342019866247openalex-snapshot
SWIRL: High-performance many-core CPU code generation for deep neural networks
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-13188-2_19openalex-snapshot
SMT-Based Translation Validation for Machine Learning Compiler
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.1007/978-3-031-64626-3_17openalex-snapshot
Verified Validation for Affine Scheduling in Polyhedral Compilation
inferred← citeshttps://doi.org/10.1007/978-3-031-68150-9_9openalex-snapshot
Verifying a Radio Telescope Pipeline Using HaliVer: Solving Nonlinear and Quantifier Challenges
inferred← citeshttps://doi.org/10.1007/978-981-99-8311-7_15openalex-snapshot
TorchProbe: Fuzzing Dynamic Deep Learning Compilers
inferred← citeshttps://doi.org/10.1145/3519939.3523446openalex-snapshot
Exocompilation for productive programming of hardware accelerators
inferred← citeshttps://doi.org/10.1145/3578360.3580269openalex-snapshot
(De/Re)-Compositions Expressed Systematically via MDH-Based Schedules
inferred← citeshttps://doi.org/10.1145/3579990.3580020openalex-snapshot
Looplets: A Language for Structured Coiteration
inferred← citeshttps://doi.org/10.1145/3591268openalex-snapshot
Indexed Streams: A Formal Intermediate Representation for Fused Contraction Programs
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/3652588openalex-snapshot
Proceedings of the 13th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis
inferred← citeshttps://doi.org/10.1145/3652588.3663320openalex-snapshot
Interactive Source-to-Source Optimizations Validated using Static Resource Analysis
inferred← citeshttps://doi.org/10.1145/3656390openalex-snapshot
A Verified Compiler for a Functional Tensor Language
inferred← citeshttps://doi.org/10.1145/3656403openalex-snapshot
Mechanised Hypersafety Proofs about Structured Data
inferred← citeshttps://doi.org/10.1145/3665643openalex-snapshot
(De/Re)-Composition of Data-Parallel Computations via Multi-Dimensional Homomorphisms
inferred← citeshttps://doi.org/10.1145/3687948openalex-snapshot
UFO Instruction Graphs Are Machine Knittable
inferred← citeshttps://doi.org/10.1145/3689741openalex-snapshot
CoolerSpace: A Language for Physically Correct and Computationally Efficient Color Programming
inferred← citeshttps://doi.org/10.1145/3689752openalex-snapshot
Compilation of Shape Operators on Sparse Arrays
inferred← citeshttps://doi.org/10.1145/3720473openalex-snapshot
Finch: Sparse and Structured Tensor Programming with Control Flow
inferred← citeshttps://doi.org/10.1145/3731599.3767572openalex-snapshot
Reduction-Aware Directive-Based Programming via Multi-Dimensional Homomorphisms
inferred← citeshttps://doi.org/10.1145/3747524openalex-snapshot
Correctness Meets Performance: From Agda to Futhark
inferred← citeshttps://doi.org/10.1145/3808261openalex-snapshot
A Mechanized Algebra of Verified Data Structures for Optimizing Sparse Tensor Programs
inferred← citeshttps://doi.org/10.1145/3808304openalex-snapshot
Verifying Array Properties in Pure Data-Parallel Programs
inferred← citeshttps://doi.org/10.23919/date69613.2026.11539281openalex-snapshot
VLIM: Verified Loop Interchange for Optimised Matrix Multiplication
inferred← citeshttps://doi.org/10.3389/fcomp.2022.931312openalex-snapshot
P3 problem and Magnolia language: Specializing array computations for emerging architectures
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.