On the public citation graph
Separation logic
0 signed · 129 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/10722010_8openalex-snapshot
Proving Pointer Programs in Hoare Logic
inferredcites →https://doi.org/10.1007/11691372_19openalex-snapshot
A Local Shape Analysis Based on Separation Logic
inferredcites →https://doi.org/10.1007/11804192_6openalex-snapshot
Smallfoot: Modular Automatic Assertion Checking with Separation Logic
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-319-17524-9_1openalex-snapshot
Moving Fast with Software Verification
inferredcites →https://doi.org/10.1007/978-3-319-41540-6_4openalex-snapshot
A Practical Verification Framework for Preemptive OS Kernels
inferredcites →https://doi.org/10.1007/978-3-540-70545-1_36openalex-snapshot
Scalable Shape Analysis for Systems Code
inferredcites →https://doi.org/10.1007/978-3-642-14107-2_24openalex-snapshot
Concurrent Abstract Predicates
inferredcites →https://doi.org/10.1007/978-3-642-15057-9_14openalex-snapshot
Abstraction and Refinement for Local Reasoning
inferredcites →https://doi.org/10.1007/978-3-642-22110-1_15openalex-snapshot
SLAyer: Memory Safety for Systems-Level Code
inferredcites →https://doi.org/10.1007/978-3-662-54434-1_26openalex-snapshot
The Essence of Higher-Order Concurrent Separation Logic
inferredcites →https://doi.org/10.1007/978-94-011-1793-7_4openalex-snapshot
Assigning Meanings to Programs
inferredcites →https://doi.org/10.1016/j.jlap.2011.04.005openalex-snapshot
Concurrent Kleene Algebra and its Foundations
inferredcites →https://doi.org/10.1016/j.scico.2013.01.006openalex-snapshot
Software verification with VeriFast: Industrial case studies
inferredcites →https://doi.org/10.1016/j.tcs.2003.11.020openalex-snapshot
Possible worlds and resources: the semantics of BI
inferredcites →https://doi.org/10.1016/j.tcs.2006.12.034openalex-snapshot
A semantics for concurrent separation logic
inferredcites →https://doi.org/10.1016/j.tcs.2006.12.035openalex-snapshot
Resources, concurrency, and local reasoning
inferredcites →https://doi.org/10.1017/cbo9781107256552openalex-snapshot
Program Logics for Certified Compilers
inferredcites →https://doi.org/10.1090/psapm/019/0235771openalex-snapshot
Assigning meanings to programs
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/lics.2006.52openalex-snapshot
Variables as Resource in Hoare Logics
inferredcites →https://doi.org/10.1109/lics.2007.30openalex-snapshot
Local Action and Abstract Separation Logic
inferredcites →https://doi.org/10.1145/1040305.1040327openalex-snapshot
Permission accounting in separation logic
inferredcites →https://doi.org/10.1145/1275497.1275499openalex-snapshot
BI-hyperdoctrines, higher-order separation logic, and abstraction
inferredcites →https://doi.org/10.1145/1988042.1988050openalex-snapshot
BI as an assertion language for mutable data structures
inferredcites →https://doi.org/10.1145/2049697.2049700openalex-snapshot
Compositional Shape Analysis by Means of Bi-Abduction
inferredcites →https://doi.org/10.1145/2429069.2429131openalex-snapshot
The ramifications of sharing in data structures
inferredcites →https://doi.org/10.1145/2737924.2737964openalex-snapshot
Mechanized verification of fine-grained concurrent programs
inferredcites →https://doi.org/10.1145/2815400.2815402openalex-snapshot
Using Crash Hoare logic for certifying the FSCQ file system
inferredcites →https://doi.org/10.1145/3158154openalex-snapshot
RustBelt: securing the foundations of the Rust programming language
inferredcites →https://doi.org/10.1145/360204.375719openalex-snapshot
BI as an assertion language for mutable data structures
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.25405/ncl.34125705openalex-snapshot
Specification and Design of (Parallel) Programs
inferredcites →https://doi.org/10.5555/1883978.1884012openalex-snapshot
Concurrent abstract predicates
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spe.3057openalex-snapshot
SafeOSL: Ensuring memory safety of C via ownership‐based intermediate language
inferred← citeshttps://doi.org/10.1007/978-3-030-17502-3_8openalex-snapshot
SL-COMP: Competition of Solvers for Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-31038-7_1openalex-snapshot
A Calculus of Space, Time, and Causality: Its Algebra, Geometry, Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-61362-4_1openalex-snapshot
Who Carries the Burden of Modularity?
inferred← citeshttps://doi.org/10.1007/978-3-030-77448-6_10openalex-snapshot
Architecture of InnoChain, a Formally-Verified Distributed Ledger System
inferred← citeshttps://doi.org/10.1007/978-3-030-85248-1_5openalex-snapshot
Modular Transformation of Java Exceptions Modulo Errors
inferred← citeshttps://doi.org/10.1007/978-3-030-88701-8_20openalex-snapshot
On Algebra of Program Correctness and Incorrectness
inferred← citeshttps://doi.org/10.1007/978-3-030-89051-3_2openalex-snapshot
Function Pointer Eliminator for C Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-01806-0openalex-snapshot
Automated Verification of Concurrent Search Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-06773-0_5openalex-snapshot
The Prusti Project: Formal Verification for Rust
inferred← citeshttps://doi.org/10.1007/978-3-031-19756-7_14openalex-snapshot
Verified Software Units for Simple DFA Modules and Objects in C
inferred← citeshttps://doi.org/10.1007/978-3-031-27481-7_19openalex-snapshot
VeyMont: Parallelising Verified Programs Instead of Verifying Parallel Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-87345-4_4openalex-snapshot
Minimalistic System Modelling: Behaviours, Interfaces, and Local Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-031-88930-1_2openalex-snapshot
Some Uses of Modal Semirings
inferred← citeshttps://doi.org/10.1007/978-3-032-22749-2_10openalex-snapshot
Gillian Debugging: Swinging Through the (Compositional Symbolic Execution) Trees
inferred← citeshttps://doi.org/10.1007/978-3-032-26220-2_5openalex-snapshot
A Framework for the Interoperable Specification and Verification of Encapsulated Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-032-32526-6_12openalex-snapshot
Automatic Heap-Memory Diagrams for Separation-Logic Proofs
inferred← citeshttps://doi.org/10.1007/s00165-019-00501-3openalex-snapshot
Fifty years of Hoare’s logic
inferred← citeshttps://doi.org/10.1007/s10009-021-00628-wopenalex-snapshot
SL-COMP: competition of solvers for separation logic
inferred← citeshttps://doi.org/10.1007/s10817-025-09739-4openalex-snapshot
First-order Hybrid Separation Logic
inferred← citeshttps://doi.org/10.1007/s13218-024-00855-8openalex-snapshot
Challenges for Non-Classical Reasoning in Contemporary AI Applications
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/j.infsof.2023.107219openalex-snapshot
HGIVul: Detecting inter-procedural vulnerabilities based on hypergraph convolution
inferred← citeshttps://doi.org/10.1016/j.jlamp.2020.100619openalex-snapshot
(Co)inductive proof systems for compositional proofs in reachability logic
inferred← citeshttps://doi.org/10.1016/j.jlamp.2026.101193openalex-snapshot
A separation logic for cloud-edge application management
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114854openalex-snapshot
Restriction on cut rule in cyclic-proof system for symbolic heaps
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115560openalex-snapshot
The Autonomous Data Language – Concepts, design and formal verification
inferred← citeshttps://doi.org/10.1049/iet-cps.2018.5006openalex-snapshot
Survey on automated symbolic verification and its application for synthesising cyber‐physical systems
inferred← citeshttps://doi.org/10.1109/access.2021.3128382openalex-snapshot
An Abstract Machine Approach to Preserving Digital Information
inferred← citeshttps://doi.org/10.1109/conisoft50191.2020.00024openalex-snapshot
Formal Verification of a Database Management System
inferred← citeshttps://doi.org/10.1109/fdl50818.2020.9232945openalex-snapshot
An Algebra of Deterministic Propositional Acceptance Automata (DPAA)
inferred← citeshttps://doi.org/10.1109/icse-nier52604.2021.00021openalex-snapshot
Software Ticks Need No Specifications
inferred← citeshttps://doi.org/10.1109/scam55253.2022.00028openalex-snapshot
Summary-Based Compositional Analysis for Soft Contract Verification
inferred← citeshttps://doi.org/10.1134/s036176882108017xopenalex-snapshot
Database Management System Verification with Separation Logics
inferred← citeshttps://doi.org/10.1142/s0218194022500668openalex-snapshot
Matching Logic Based on Ownership Transfer
inferred← citeshttps://doi.org/10.1145/3408978openalex-snapshot
Cosmo: a concurrent separation logic for multicore OCaml
inferred← citeshttps://doi.org/10.1145/3408998openalex-snapshot
Separation logic for sequential programs (functional pearl)
inferred← citeshttps://doi.org/10.1145/3434314openalex-snapshot
A separation logic for effect handlers
inferred← citeshttps://doi.org/10.1145/3477143openalex-snapshot
Completeness and Complexity of Reasoning about Call-by-Value in Hoare Logic
inferred← citeshttps://doi.org/10.1145/3477355.3477359openalex-snapshot
Assessing the Success and Impact of Hoare’s Logic
inferred← citeshttps://doi.org/10.1145/3485542openalex-snapshot
JavaDL: automatically incrementalizing Java bug pattern detection
inferred← citeshttps://doi.org/10.1145/3497775.3503677openalex-snapshot
Specification and verification of a transient stack
inferred← citeshttps://doi.org/10.1145/3497775.3503690openalex-snapshot
Semantic cut elimination for the logic of bunched implications, formalized in Coq
inferred← citeshttps://doi.org/10.1145/3498672openalex-snapshot
A separation logic for heap space under garbage collection
inferred← citeshttps://doi.org/10.1145/3563318openalex-snapshot
A bunch of sessions: a propositions-as-sessions interpretation of bunched implications in channel-based concurrency
inferred← citeshttps://doi.org/10.1145/3571218openalex-snapshot
A High-Level Separation Logic for Heap Space under Garbage Collection (Extended Version)
inferred← citeshttps://doi.org/10.1145/3579834openalex-snapshot
Omnisemantics: Smooth Handling of Nondeterminism
inferred← citeshttps://doi.org/10.1145/3589250openalex-snapshot
Proceedings of the 12th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis
inferred← citeshttps://doi.org/10.1145/3589250.3596143openalex-snapshot
Completeness Thresholds for Memory Safety of Array Traversing Programs
inferred← citeshttps://doi.org/10.1145/3640537.3641579openalex-snapshot
Clog: A Declarative Language for C Static Code Checkers
inferred← citeshttps://doi.org/10.1145/3649830openalex-snapshot
Inductive Diagrams for Causal Reasoning
inferred← citeshttps://doi.org/10.1145/3664807openalex-snapshot
Code to Qed, the Project Manager's Guide to Proof Engineering
inferred← citeshttps://doi.org/10.1145/3689609.3689994openalex-snapshot
C-2PO: A Weakly Relational Pointer Domain: “These Are Not the Memory Cells You Are Looking For”
inferred← citeshttps://doi.org/10.1145/3696450openalex-snapshot
Evolving Paradigms in Automated Program Repair: Taxonomy, Challenges, and Opportunities
inferred← citeshttps://doi.org/10.1145/3704903openalex-snapshot
Generically Automating Separation Logic by Functors, Homomorphisms, and Modules
inferred← citeshttps://doi.org/10.1145/3704915openalex-snapshot
Tail Modulo Cons, OCaml, and Relational Separation Logic
inferred← citeshttps://doi.org/10.1145/3716312openalex-snapshot
Will It Fit? Verifying Heap Space Bounds of Concurrent Programs under Garbage Collection
inferred← citeshttps://doi.org/10.1145/3729250openalex-snapshot
Nola: Later-Free Ghost State for Verifying Termination in Iris
inferred← citeshttps://doi.org/10.1145/3756681.3756999openalex-snapshot
LAMeD: LLM-generated Annotations for Memory Leak Detection
inferred← citeshttps://doi.org/10.1145/3764860.3768326openalex-snapshot
Debug, Execute, Verify! Development-Verification Co-Design Made Practical
inferred← citeshttps://doi.org/10.1145/3776688openalex-snapshot
U-Turn: Enhancing Incorrectness Analysis by Reversing Direction
inferred← citeshttps://doi.org/10.1145/3779031.3779096openalex-snapshot
Precise Reasoning about Container-Internal Pointers with Logical Pinning
inferred← citeshttps://doi.org/10.1145/3841644.3842686openalex-snapshot
Introducing Hoare Logic in the Undergraduate CS Curriculum
inferred← citeshttps://doi.org/10.15514/ispras-2023-35(3)-9openalex-snapshot
Alias Analysis and Calculus based on Segmentation Address Memory Model
inferred← citeshttps://doi.org/10.18255/1818-1015-2020-4-472-487openalex-snapshot
Architecture of the Formally-Verified Distributed Ledger System InnoChain
inferred← citeshttps://doi.org/10.21203/rs.3.rs-1827512/v1openalex-snapshot
Semantic Cut Elimination for the Logic of Bunched Implications and Structural Extensions, Formalized in Coq
inferred← citeshttps://doi.org/10.2139/ssrn.6339233openalex-snapshot
SwitchSTM: Enabling Transaction Switching in Loop-Based Software Transactional Memory Applications via Coroutines
inferred← citeshttps://doi.org/10.2197/ipsjjip.33.445openalex-snapshot
Cyclic-proof Systems for Symbolic Heaps Require Cut Formulas Outside Initial Signatures
inferred← citeshttps://doi.org/10.2200/s01089ed1v01y202104csl013openalex-snapshot
Automated Verification of Concurrent Search Structures
inferred← citeshttps://doi.org/10.23919/cje.2022.00.116openalex-snapshot
Formal Verification of Data Modifications in Cloud Block Storage Based on Separation Logic
inferred← citeshttps://doi.org/10.2478/tar-2026-0011openalex-snapshot
Aerolang: A Dimensionally-Aware Domain-Specific Language for Real-Time Flight Control with Integrated Morphing Wing Physics
inferred← citeshttps://doi.org/10.4204/eptcs.303.3openalex-snapshot
(Co)inductive Proof Systems for Compositional Proofs in Reachability Logic
inferred← citeshttps://doi.org/10.4204/eptcs.427.2openalex-snapshot
Pleasant Imperative Program Proofs with GallinaC
inferred← citeshttps://doi.org/10.46298/lmcs-19(4:5)2023openalex-snapshot
Verifying an Effect-Handler-Based Define-By-Run Reverse-Mode AD Library
inferred← citeshttps://doi.org/10.48175/ijarsct-27702openalex-snapshot
Formal Verification of Data Modifications in Cloud Block Storage Based on Separation Logic
inferred← citeshttps://doi.org/10.48550/arxiv.2006.16345openalex-snapshot
SeMPE: Secure Multi Path Execution Architecture for Removing Conditional Branch Side Channels
inferred← citeshttps://doi.org/10.70675/0060a957z6f8ez44e2z9a5dze9b2f3193fcbopenalex-snapshot
Logiques de séparation : complexité, expressivité, calculs
inferred← citeshttps://doi.org/10.70675/0d242e5czfe16z49f6za04ezf51f4dabb08eopenalex-snapshot
Mechanized semantics and verified compilation for a dataflow synchronous language with reset
inferred← citeshttps://doi.org/10.70675/5a9cee0bz162ez41ebz9f00z288fb5fd7460openalex-snapshot
CoqDRAM - A Foundation for Designing Formally Proven Memory Controllers
inferred← citeshttps://doi.org/10.70675/658f5039z38c0z4648zbde8z7a6a9a026c58openalex-snapshot
Principe de transduction sémantique pour l’application de théories d’interfaces sur des documents de spécification
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.