On the public citation graph

A Quantum interpretation of separating conjunction for local reasoning of Quantum programs based on separation logic

0 signed · 35 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/3-540-44802-0_1openalex-snapshot
Local Reasoning about Programs that Alter Data Structures
inferredcites →https://doi.org/10.1007/3-540-45931-6_28openalex-snapshot
A Semantic Basis for Local Reasoning
inferredcites →https://doi.org/10.1007/978-3-030-25543-5_12openalex-snapshot
Formal Verification of Quantum Algorithms Using Quantum Hoare Logic
inferredcites →https://doi.org/10.1007/s00165-018-0465-3openalex-snapshot
Toward automatic verification of quantum programs
inferredcites →https://doi.org/10.1016/j.parco.2014.12.001openalex-snapshot
ScaffCC: Scalable compilation and analysis of quantum programs
inferredcites →https://doi.org/10.1038/299802a0openalex-snapshot
A single quantum cannot be cloned
inferredcites →https://doi.org/10.1098/rspa.1992.0167openalex-snapshot
Rapid solution of problems by quantum computation
inferredcites →https://doi.org/10.1109/iccd.2013.6657075openalex-snapshot
Chisel-Q: Designing quantum circuits with a scala embedded language
inferredcites →https://doi.org/10.1109/lics.2007.30openalex-snapshot
Local Action and Abstract Separation Logic
inferredcites →https://doi.org/10.1109/sfcs.1994.365700openalex-snapshot
Algorithms for quantum computation: discrete logarithms and factoring
inferredcites →https://doi.org/10.1137/s0097539796300933openalex-snapshot
Strengths and Weaknesses of Quantum Computing
inferredcites →https://doi.org/10.1145/2049706.2049708openalex-snapshot
Floyd--hoare logic for quantum programs
inferredcites →https://doi.org/10.1145/237814.237866openalex-snapshot
A fast quantum mechanical algorithm for database search
inferredcites →https://doi.org/10.1145/3158123openalex-snapshot
Algorithmic analysis of termination problems for quantum programs
inferredcites →https://doi.org/10.1145/3183895.3183901openalex-snapshot
Q#
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1360/n112017-00095openalex-snapshot
$Q|SI\rangle $ : a quantum programming environment
inferredcites →https://doi.org/10.22331/q-2018-01-31-49openalex-snapshot
ProjectQ: an open source software framework for quantum computing
inferredcites →https://doi.org/10.2307/421090openalex-snapshot
The Logic of Bunched Implications

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-50521-8_8openalex-snapshot
Local Reasoning About Probabilistic Behaviour for Classical–Quantum Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-98685-7_3openalex-snapshot
D-Hammer: Efficient Equational Reasoning for Labelled Dirac Notation
inferred← citeshttps://doi.org/10.1016/b978-0-44-315942-8.00009-5openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1016/b978-0-44-315942-8.00016-2openalex-snapshot
Quantum Hoare logic
inferred← citeshttps://doi.org/10.1016/b978-0-44-315942-8.00018-6openalex-snapshot
Verification of quantum programs
inferred← citeshttps://doi.org/10.1016/b978-0-44-315942-8.00021-6openalex-snapshot
Parallel quantum programs
inferred← citeshttps://doi.org/10.1016/b978-0-44-315942-8.00030-7openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/j.ic.2026.105417openalex-snapshot
A practical quantum Hoare logic with classical variables, I
inferred← citeshttps://doi.org/10.1109/jetcas.2022.3205174openalex-snapshot
Advances in Quantum Computation and Quantum Technologies: A Design Automation Perspective
inferred← citeshttps://doi.org/10.1109/qsw59989.2023.00029openalex-snapshot
QIn: Enabling Formal Methods to Deal with Quantum Circuits
inferred← citeshttps://doi.org/10.1145/3571222openalex-snapshot
CoqQ: Foundational Verification of Quantum Programs
inferred← citeshttps://doi.org/10.1145/3704878openalex-snapshot
Automating Equational Proofs in Dirac Notation
inferred← citeshttps://doi.org/10.1145/3729293openalex-snapshot
Efficient Formal Verification of Quantum Error Correcting Programs
inferred← citeshttps://doi.org/10.1145/3763153openalex-snapshot
Scalable Equivalence Checking and Verification of Shallow Quantum Circuits
inferred← citeshttps://doi.org/10.1145/3763157openalex-snapshot
Embedding Quantum Program Verification into Dafny
inferred← citeshttps://doi.org/10.1145/3776658openalex-snapshot
An Expressive Assertion Language for Quantum Programs
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.