On the public citation graph

Proving hypersafety compositionally

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.1002/stvr.1472openalex-snapshot
Regression verification: proving the equivalence of similar programs
inferredcites →https://doi.org/10.1007/11547662_24openalex-snapshot
Secure Information Flow as a Safety Problem
inferredcites →https://doi.org/10.1007/3-540-45657-0_14openalex-snapshot
A Modular Checker for Multithreaded Programs
inferredcites →https://doi.org/10.1007/3-540-48153-2_30openalex-snapshot
Circular Compositional Reasoning about Liveness
inferredcites →https://doi.org/10.1007/978-3-030-25540-4_11openalex-snapshot
Automated Hypersafety Verification
inferredcites →https://doi.org/10.1007/978-3-030-25540-4_9openalex-snapshot
Property Directed Self Composition
inferredcites →https://doi.org/10.1007/978-3-030-67067-2_4openalex-snapshot
Compositional Model Checking for Multi-properties
inferredcites →https://doi.org/10.1007/978-3-030-81685-8_35openalex-snapshot
Constraint-Based Relational Verification
inferredcites →https://doi.org/10.1007/978-3-540-32004-3_20openalex-snapshot
A Theorem Proving Approach to Analysis of Secure Information Flow
inferredcites →https://doi.org/10.1007/978-3-642-21437-0_17openalex-snapshot
Relational Verification Using Product Programs
inferredcites →https://doi.org/10.1007/978-3-642-22110-1_32openalex-snapshot
Threader: A Constraint-Based Verifier for Multi-threaded Programs
inferredcites →https://doi.org/10.1007/978-3-642-22863-6_6openalex-snapshot
Relational Decomposition
inferredcites →https://doi.org/10.1007/978-3-642-54792-8_15openalex-snapshot
Temporal Logics for Hyperproperties
inferredcites →https://doi.org/10.1016/j.jlamp.2016.05.004openalex-snapshot
Product programs and relational program logics
inferredcites →https://doi.org/10.1016/j.tcs.2006.12.036openalex-snapshot
Relational separation logic
inferredcites →https://doi.org/10.1017/s0956796819000145openalex-snapshot
A relational logic for higher-order programs
inferredcites →https://doi.org/10.1109/csf.2007.30openalex-snapshot
Secure information flow and program logics
inferredcites →https://doi.org/10.1109/csf.2008.7openalex-snapshot
Hyperproperties
inferredcites →https://doi.org/10.1109/csfw.2004.17openalex-snapshot
Secure information flow by self-composition
inferredcites →https://doi.org/10.1109/lics52264.2021.9470690openalex-snapshot
Alignment Completeness for Relational Hoare Logics
inferredcites →https://doi.org/10.1145/2103656.2103711openalex-snapshot
A rely-guarantee-based simulation for verifying concurrent program transformations
inferredcites →https://doi.org/10.1145/2492061openalex-snapshot
Probabilistic Relational Reasoning for Differential Privacy
inferredcites →https://doi.org/10.1145/2508859.2516721openalex-snapshot
Relational abstract interpretation for the verification of 2-hypersafety properties
inferredcites →https://doi.org/10.1145/2908080.2908092openalex-snapshot
Cartesian hoare logic for verifying k-safety properties
inferredcites →https://doi.org/10.1145/3009837.3009896openalex-snapshot
Coupling proofs are probabilistic product programs
inferredcites →https://doi.org/10.1145/3209108.3209174openalex-snapshot
ReLoC
inferredcites →https://doi.org/10.1145/3324783openalex-snapshot
Modular Product Programs
inferredcites →https://doi.org/10.1145/3563298openalex-snapshot
Proving hypersafety compositionally
inferredcites →https://doi.org/10.1145/964001.964003openalex-snapshot
Simple relational correctness proofs for static analyses and program transformations

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-57249-4_10openalex-snapshot
Automated Software Verification of Hyperliveness
inferred← citeshttps://doi.org/10.1007/978-3-031-93706-4_23openalex-snapshot
Extending Dynamic Logics with First-Class Relational Reasoning
inferred← citeshttps://doi.org/10.1007/s10703-025-00482-5openalex-snapshot
Predicate abstraction for hyperliveness verification
inferred← citeshttps://doi.org/10.1145/3571213openalex-snapshot
An Algebra of Alignment for Relational Verification
inferred← citeshttps://doi.org/10.1145/3656403openalex-snapshot
Mechanised Hypersafety Proofs about Structured Data
inferred← citeshttps://doi.org/10.1145/3656437openalex-snapshot
Hyper Hoare Logic: (Dis-)Proving Program Hyperproperties
inferred← citeshttps://doi.org/10.1145/3689740openalex-snapshot
Quantitative Weakest Hyper Pre: Unifying Correctness and Incorrectness Hyperproperties via Predicate Transformers
inferred← citeshttps://doi.org/10.1145/3689756openalex-snapshot
Hypra: A Deductive Program Verifier for Hyper Hoare Logic
inferred← citeshttps://doi.org/10.1145/3704889openalex-snapshot
Coinductive Proofs for Temporal Hyperliveness
inferred← citeshttps://doi.org/10.1145/3704894openalex-snapshot
Bluebell: An Alliance of Relational Lifting and Independence for Probabilistic Reasoning
inferred← citeshttps://doi.org/10.1145/3763064openalex-snapshot
Reasoning about External Calls
inferred← citeshttps://doi.org/10.1145/3763130openalex-snapshot
Verifying Asynchronous Hyperproperties in Reactive Systems
inferred← citeshttps://doi.org/10.1145/3763138openalex-snapshot
Encode the ∀∃ Relational Hoare Logic into Standard Hoare Logic
inferred← citeshttps://doi.org/10.1145/3808328openalex-snapshot
Hyper Separation Logic
inferred← citeshttps://doi.org/10.1145/3839520openalex-snapshot
Infinitary Relational Logic
showing the first 15 of 16 · page through all 16
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.