On the public citation graph
Theorems for free from separation logic specifications
0 signed · 63 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.1006/inco.1993.1037openalex-snapshot
On Functors Expressible in the Polymorphic Typed Lambda Calculus
inferredcites →https://doi.org/10.1007/11417170_22openalex-snapshot
L3: A Linear Language with Locations
inferredcites →https://doi.org/10.1007/978-3-319-89884-1_27openalex-snapshot
Session-Typed Concurrent Contracts
inferredcites →https://doi.org/10.1007/978-3-642-03013-0_10openalex-snapshot
Practical API Protocol Checking with Access Permissions
inferredcites →https://doi.org/10.1007/978-3-642-15375-4_27openalex-snapshot
Reasoning about Optimistic Concurrency Using a Program Logic for History
inferredcites →https://doi.org/10.1007/978-3-642-37036-6_15openalex-snapshot
Verifying Concurrent Memory Reclamation Algorithms with Grace
inferredcites →https://doi.org/10.1007/978-3-642-54833-8_10openalex-snapshot
Local Reasoning for the POSIX File System
inferredcites →https://doi.org/10.1007/978-3-662-44202-9_9openalex-snapshot
TaDA: A Logic for Time and Data Abstraction
inferredcites →https://doi.org/10.1007/978-3-662-46669-8_14openalex-snapshot
Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity
inferredcites →https://doi.org/10.1007/bfb0053567openalex-snapshot
Language primitives and type discipline for structured communication-based programming
inferredcites →https://doi.org/10.1007/s10817-018-9457-5openalex-snapshot
VST-Floyd: A Separation Logic Tool to Verify Correctness of C Programs
inferredcites →https://doi.org/10.1007/s10990-008-9032-6openalex-snapshot
Types and trace effects for object orientation
inferredcites →https://doi.org/10.1016/j.ic.2012.05.002openalex-snapshot
Fundamentals of session types
inferredcites →https://doi.org/10.1017/s0956796807006466openalex-snapshot
Types and trace effects of higher order programs
inferredcites →https://doi.org/10.1017/s0956796810000134openalex-snapshot
Roles, stacks, histories: A triple for Hoare
inferredcites →https://doi.org/10.1017/s0956796813000142openalex-snapshot
Secure distributed programming with value-dependent types
inferredcites →https://doi.org/10.1017/s0956796818000151openalex-snapshot
Iris from the ground up: A modular foundation for higher-order concurrent separation logic
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/tse.1986.6312929openalex-snapshot
Typestate: A programming language concept for enhancing software reliability
inferredcites →https://doi.org/10.1145/1040305.1040326openalex-snapshot
Separation logic and abstraction
inferredcites →https://doi.org/10.1145/1047659.1040326openalex-snapshot
Separation logic and abstraction
inferredcites →https://doi.org/10.1145/1275497.1275499openalex-snapshot
BI-hyperdoctrines, higher-order separation logic, and abstraction
inferredcites →https://doi.org/10.1145/1297027.1297050openalex-snapshot
Modular typestate checking of aliased objects
inferredcites →https://doi.org/10.1145/1297105.1297050openalex-snapshot
Modular typestate checking of aliased objects
inferredcites →https://doi.org/10.1145/1449764.1449792openalex-snapshot
Typestate-like analysis of multiple interacting objects
inferredcites →https://doi.org/10.1145/1480881.1480933openalex-snapshot
Types and higher-order recursion schemes for verification of higher-order programs
inferredcites →https://doi.org/10.1145/1481861.1481874openalex-snapshot
Design patterns in separation logic
inferredcites →https://doi.org/10.1145/1594834.1480933openalex-snapshot
Types and higher-order recursion schemes for verification of higher-order programs
inferredcites →https://doi.org/10.1145/1708016.1708027openalex-snapshot
Lightweight linear types in system f°
inferredcites →https://doi.org/10.1145/1890028.1890031openalex-snapshot
Refinement types for secure implementations
inferredcites →https://doi.org/10.1145/1988042.1988050openalex-snapshot
BI as an assertion language for mutable data structures
inferredcites →https://doi.org/10.1145/2837022openalex-snapshot
The Design and Formalization of Mezzo, a Permission-Based Programming Language
inferredcites →https://doi.org/10.1145/3293880.3294106openalex-snapshot
From C to interaction trees: specifying, verifying, and testing a networked server
inferredcites →https://doi.org/10.1145/3371119openalex-snapshot
Interaction trees: representing recursive and impure programs in Coq
inferredcites →https://doi.org/10.1145/360204.375719openalex-snapshot
BI as an assertion language for mutable data structures
inferredcites →https://doi.org/10.1145/381694.378811openalex-snapshot
Enforcing high-level protocols in low-level software
inferredcites →https://doi.org/10.1145/78969.78972openalex-snapshot
Linearizability: a correctness condition for concurrent objects
inferredcites →https://doi.org/10.4230/lipics.snapl.2015.221openalex-snapshot
A Few Lessons from the Mezzo Project
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1145/3473571openalex-snapshot
Formal verification of a concurrent bounded queue in a weak memory model
inferred← citeshttps://doi.org/10.1145/3497775.3503689openalex-snapshot
Mechanized verification of a fine-grained concurrent queue from meta’s folly library
inferred← citeshttps://doi.org/10.1145/3519939.3523451openalex-snapshot
Compass: strong and compositional library specifications in relaxed memory separation logic
inferred← citeshttps://doi.org/10.1145/3547631openalex-snapshot
Later credits: resourceful reasoning for the later modality
inferred← citeshttps://doi.org/10.1145/3563317openalex-snapshot
Necessity specifications for robustness
inferred← citeshttps://doi.org/10.1145/3571231openalex-snapshot
A Compositional Theory of Linearizability
inferred← citeshttps://doi.org/10.1145/3571246openalex-snapshot
An Operational Approach to Library Abstraction under Relaxed Memory Concurrency
inferred← citeshttps://doi.org/10.1145/3586043openalex-snapshot
Proof Automation for Linearizability in Separation Logic
inferred← citeshttps://doi.org/10.1145/3632851openalex-snapshot
Trillium: Higher-Order Concurrent and Distributed Separation Logic for Intensional Refinement
inferred← citeshttps://doi.org/10.1145/3632862openalex-snapshot
The Logical Essence of Well-Bracketed Control Flow
inferred← citeshttps://doi.org/10.1145/3636501.3636940openalex-snapshot
Compositional Verification of Concurrent C Programs with Search Structure Templates
inferred← citeshttps://doi.org/10.1145/3643668openalex-snapshot
A Compositional Theory of Linearizability
inferred← citeshttps://doi.org/10.1145/3656384openalex-snapshot
A Proof Recipe for Linearizability in Relaxed Memory Separation Logic
inferred← citeshttps://doi.org/10.1145/3694906.3743304openalex-snapshot
Formal Machine-Verification of MemSnap: An Efficient, Far-Future Linearizable Snapshot Algorithm
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/3729248openalex-snapshot
Verifying Lock-Free Traversals in Relaxed Memory Separation Logic
inferred← citeshttps://doi.org/10.1145/3747515openalex-snapshot
Reasoning about Weak Isolation Levels in Separation Logic
inferred← citeshttps://doi.org/10.1145/3808337openalex-snapshot
A Verified Parallel Scheduler for OCaml 5
inferred← citeshttps://doi.org/10.2197/ipsjjip.31.21openalex-snapshot
Conjuring Fusion Laws via Relational Calculus
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.