On the public citation graph

Iron: managing obligations in higher-order concurrent separation logic

https://doi.org/10.1145/3290378
0 signed · 53 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-44898-5_4openalex-snapshot
Checking Interference with Fractional Permissions
inferredcites →https://doi.org/10.1007/978-3-319-71237-6_10openalex-snapshot
Bringing Order to the Separation Logic Jungle
inferredcites →https://doi.org/10.1007/978-3-540-71316-6_13openalex-snapshot
On the Relationship Between Concurrent Separation Logic and Assume-Guarantee Reasoning
inferredcites →https://doi.org/10.1007/978-3-540-74407-8_18openalex-snapshot
A Marriage of Rely/Guarantee and Separation Logic
inferredcites →https://doi.org/10.1007/978-3-540-76637-7_3openalex-snapshot
Local Reasoning for Storable Locks and Threads
inferredcites →https://doi.org/10.1007/978-3-540-78739-6_27openalex-snapshot
Oracle Semantics for Concurrent Separation Logic
inferredcites →https://doi.org/10.1007/978-3-642-11957-6_6openalex-snapshot
Amortised Resource Analysis with Separation Logic
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-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_11openalex-snapshot
Modular Reasoning about Separation of Concurrent Data Structures
inferredcites →https://doi.org/10.1007/978-3-642-54833-8_16openalex-snapshot
Communicating State Transition Systems for Fine-Grained Concurrent Resources
inferredcites →https://doi.org/10.1007/978-3-642-54833-8_9openalex-snapshot
Impredicative Concurrent Abstract Predicates
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-54434-1_26openalex-snapshot
The Essence of Higher-Order Concurrent Separation Logic
inferredcites →https://doi.org/10.1007/978-3-662-54434-1_34openalex-snapshot
A Higher-Order Logic for Concurrent Termination-Preserving Refinement
inferredcites →https://doi.org/10.1007/s10817-017-9431-7openalex-snapshot
Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits
inferredcites →https://doi.org/10.1016/j.tcs.2006.12.035openalex-snapshot
Resources, concurrency, and local reasoning
inferredcites →https://doi.org/10.1016/j.tcs.2007.09.003openalex-snapshot
A program logic for resources
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/lics.2013.18openalex-snapshot
Quantitative Reasoning for Proving Lock-Freedom
inferredcites →https://doi.org/10.1145/1217935.1217953openalex-snapshot
Language support for fast and reliable message-based communication in singularity OS
inferredcites →https://doi.org/10.1145/1480881.1480922openalex-snapshot
Local rely-guarantee reasoning
inferredcites →https://doi.org/10.1145/1988042.1988050openalex-snapshot
BI as an assertion language for mutable data structures
inferredcites →https://doi.org/10.1145/2500365.2500600openalex-snapshot
Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency
inferredcites →https://doi.org/10.1145/2676726.2676980openalex-snapshot
Iris
inferredcites →https://doi.org/10.1145/2951913.2951943openalex-snapshot
Higher-order ghost state
inferredcites →https://doi.org/10.1145/3009837.3009855openalex-snapshot
Interactive proofs in higher-order concurrent separation logic
inferredcites →https://doi.org/10.1145/3133911openalex-snapshot
A verified messaging system
inferredcites →https://doi.org/10.1145/3158152openalex-snapshot
A logical relation for monadic encapsulation of state: proving contextual equivalences in the presence of runST
inferredcites →https://doi.org/10.1145/3158154openalex-snapshot
RustBelt: securing the foundations of the Rust programming language
inferredcites →https://doi.org/10.1145/3236772openalex-snapshot
MoSeL: a general, extensible modal framework for interactive proofs in separation logic
inferredcites →https://doi.org/10.1145/373243.375719openalex-snapshot
BI as an assertion language for mutable data structures
inferredcites →https://doi.org/10.4230/lipics.ecoop.2017.17openalex-snapshot
Strong Logic for Weak Memory: Reasoning About Release-Acquire Consistency in Iris
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.1007/978-3-031-98668-0_4openalex-snapshot
Raven: An SMT-Based Concurrency Verifier
inferred← citeshttps://doi.org/10.1017/s0956796818000151openalex-snapshot
Iris from the ground up: A modular foundation for higher-order concurrent separation logic
inferred← citeshttps://doi.org/10.1145/3341301.3359632openalex-snapshot
Verifying concurrent, crash-safe systems with Perennial
inferred← citeshttps://doi.org/10.1145/3360587openalex-snapshot
Specifying concurrent programs in separation logic: morphisms and simulations
inferred← citeshttps://doi.org/10.1145/3371115openalex-snapshot
Disentanglement in nested-parallel programs
inferred← citeshttps://doi.org/10.1145/3371136openalex-snapshot
Pointer life cycle types for lock-free data structures with memory reclamation
inferred← citeshttps://doi.org/10.1145/3385412.3386029openalex-snapshot
Verifying concurrent search structure templates
inferred← citeshttps://doi.org/10.1145/3408998openalex-snapshot
Separation logic for sequential programs (functional pearl)
inferred← citeshttps://doi.org/10.1145/3434286openalex-snapshot
On algebraic abstractions for concurrent separation logics
inferred← citeshttps://doi.org/10.1145/3434299openalex-snapshot
Provably space-efficient parallel functional programming
inferred← citeshttps://doi.org/10.1145/3477082openalex-snapshot
TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs
inferred← citeshttps://doi.org/10.1145/3632848openalex-snapshot
An Iris Instance for Verifying CompCert C Programs
inferred← citeshttps://doi.org/10.1145/3632889openalex-snapshot
Deadlock-Free Separation Logic: Linearity Yields Progress for Dependent Higher-Order Message Passing
inferred← citeshttps://doi.org/10.1145/3689732openalex-snapshot
Verified Lock-Free Session Channels with Linking
inferred← citeshttps://doi.org/10.1145/3689755openalex-snapshot
Realistic Realizability: Specifying ABIs You Can Count On
inferred← citeshttps://doi.org/10.3990/1.9789036548984openalex-snapshot
Deductive techniques for model-based concurrency verification
inferred← citeshttps://doi.org/10.46298/lmcs-18(2:16)2022openalex-snapshot
Actris 2.0: Asynchronous Session-Type Based Reasoning in Separation Logic
inferred← citeshttps://doi.org/10.48550/arxiv.2007.13685openalex-snapshot
Extending Concurrent Separation Logic to Enhance Modular Formalization
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.