On the public citation graph

Mechanised Hypersafety Proofs about Structured Data

https://doi.org/10.1145/3656403
0 signed · 45 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/978-3-642-19718-5_1openalex-snapshot
Verified Software Toolchain
inferredcites →https://doi.org/10.1007/978-3-642-21437-0_17openalex-snapshot
Relational Verification Using Product Programs
inferredcites →https://doi.org/10.1016/j.tcs.2006.12.036openalex-snapshot
Relational separation logic
inferredcites →https://doi.org/10.1109/arith58626.2023.00021openalex-snapshot
LAProof: A Library of Formal Proofs of Accuracy and Correctness for Linear Algebra Programs
inferredcites →https://doi.org/10.1109/cgo.2019.8661185openalex-snapshot
Tensor Algebra Compilation with Workspaces
inferredcites →https://doi.org/10.1109/cgo53902.2022.9741282openalex-snapshot
Unified Compilation for Lossless Compression and Sparse Computing
inferredcites →https://doi.org/10.1109/correctness49594.2019.00010openalex-snapshot
Bounded Verification of Sparse Matrix Computations
inferredcites →https://doi.org/10.1109/lics.2002.1029817openalex-snapshot
Separation logic: a logic for shared mutable data structures
inferredcites →https://doi.org/10.1109/sp.2011.12openalex-snapshot
Verification of Information Flow and Access Control Policies with Dependent Types
inferredcites →https://doi.org/10.1145/1863543.1863581openalex-snapshot
Specifying and verifying sparse matrix codes
inferredcites →https://doi.org/10.1145/2034773.2034828openalex-snapshot
Characteristic formulae for the verification of imperative programs
inferredcites →https://doi.org/10.1145/2103656.2103670openalex-snapshot
Probabilistic relational reasoning for differential privacy
inferredcites →https://doi.org/10.1145/2254064.2254086openalex-snapshot
Proving acceptability properties of relaxed nondeterministic approximate programs
inferredcites →https://doi.org/10.1145/2908080.2908092openalex-snapshot
Cartesian hoare logic for verifying k-safety properties
inferredcites →https://doi.org/10.1145/3009837.3009880openalex-snapshot
Stream fusion, to completeness
inferredcites →https://doi.org/10.1145/3133900openalex-snapshot
TreeFuser: a framework for analyzing and fusing general recursive tree traversals
inferredcites →https://doi.org/10.1145/3133901openalex-snapshot
The tensor algebra compiler
inferredcites →https://doi.org/10.1145/3276493openalex-snapshot
Format abstraction for sparse tensor algebra compilers
inferredcites →https://doi.org/10.1145/3293883.3295712openalex-snapshot
Adaptive sparse tiling for sparse matrix multiplication
inferredcites →https://doi.org/10.1145/3385412.3385963openalex-snapshot
Automatic generation of efficient sparse tensor format conversion routines
inferredcites →https://doi.org/10.1145/3408998openalex-snapshot
Separation logic for sequential programs (functional pearl)
inferredcites →https://doi.org/10.1145/3473589openalex-snapshot
Certifying the synthesis of heap-manipulating programs
inferredcites →https://doi.org/10.1145/3497775.3503951openalex-snapshot
Coq’s vibrant ecosystem for verification engineering (invited talk)
inferredcites →https://doi.org/10.1145/3498717openalex-snapshot
Verified tensor-program optimization via high-level scheduling rewrites
inferredcites →https://doi.org/10.1145/3563298openalex-snapshot
Proving hypersafety compositionally
inferredcites →https://doi.org/10.1145/3563338openalex-snapshot
Compilation of dynamic sparse tensor algebra
inferredcites →https://doi.org/10.1145/3579990.3580020openalex-snapshot
Looplets: A Language for Structured Coiteration
inferredcites →https://doi.org/10.1145/3579990.3580021openalex-snapshot
Code Synthesis for Sparse Tensor Format Conversion and Optimization
inferredcites →https://doi.org/10.1145/3582016.3582047openalex-snapshot
SparseTIR: Composable Abstractions for Sparse Compilation in Deep Learning
inferredcites →https://doi.org/10.1145/3591268openalex-snapshot
Indexed Streams: A Formal Intermediate Representation for Fused Contraction Programs
inferredcites →https://doi.org/10.1145/3656403openalex-snapshot
Mechanised Hypersafety Proofs about Structured Data
inferredcites →https://doi.org/10.1145/3656437openalex-snapshot
Hyper Hoare Logic: (Dis-)Proving Program Hyperproperties
inferredcites →https://doi.org/10.1145/964001.964003openalex-snapshot
Simple relational correctness proofs for static analyses and program transformations
inferredcites →https://doi.org/10.5281/zenodo.10802913openalex-snapshot
LGTM: the Logic for Graceful Tensor Manipulation
inferredcites →https://doi.org/10.5281/zenodo.3999478openalex-snapshot
Mathematical Components

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-032-30693-7_26openalex-snapshot
Intuitive Verification of Sequential Programs Using Hybrid Reasoning
inferred← citeshttps://doi.org/10.1145/3689756openalex-snapshot
Hypra: A Deductive Program Verifier for Hyper Hoare Logic
inferred← citeshttps://doi.org/10.1145/3720474openalex-snapshot
KestRel: Relational Verification using E-Graphs for Program Alignment
inferred← citeshttps://doi.org/10.1145/3763130openalex-snapshot
Verifying Asynchronous Hyperproperties in Reactive Systems
inferred← citeshttps://doi.org/10.1145/3776719openalex-snapshot
Foundational Multi-Modal Program Verifiers
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/3808328openalex-snapshot
Hyper Separation Logic
inferred← citeshttps://doi.org/10.1145/3828694openalex-snapshot
Assertions for Free: Transferring Invariants from Algorithm to Implementation Proofs (Functional Pearl)
inferred← citeshttps://doi.org/10.1145/3839520openalex-snapshot
Infinitary Relational Logic
showing the first 9 of 10 · page through all 10
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.