On the public citation graph
Specifying concurrent programs in separation logic: morphisms and simulations
0 signed · 99 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.1995.1134openalex-snapshot
Forward and Backward Simulations
inferredcites →https://doi.org/10.1006/inco.1996.0060openalex-snapshot
Forward and Backward Simulations
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/978-1-4612-6315-9_16openalex-snapshot
Towards a Theory of Parallel Programming
inferredcites →https://doi.org/10.1007/978-1-4757-3472-0_6openalex-snapshot
Towards a Theory of Parallel Programming
inferredcites →https://doi.org/10.1007/978-1-84882-736-3_7openalex-snapshot
Separation Logic and Concurrency
inferredcites →https://doi.org/10.1007/978-3-319-06410-9_9openalex-snapshot
The VerCors Tool for Verification of Concurrent Programs
inferredcites →https://doi.org/10.1007/978-3-319-63390-9_28openalex-snapshot
Proving Linearizability Using Forward Simulations
inferredcites →https://doi.org/10.1007/978-3-540-70583-3_52openalex-snapshot
Building a Collision-Resistant Compression Function from Non-compressing Primitives
inferredcites →https://doi.org/10.1007/978-3-540-78499-9_26openalex-snapshot
The Implicit Calculus of Constructions as a Programming Language with Dependent Types
inferredcites →https://doi.org/10.1007/978-3-642-03741-2_6openalex-snapshot
Coalgebraic Components in a Many-Sorted Microcosm
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-20398-5_4openalex-snapshot
VeriFast: A Powerful, Sound, Predictable, Fast Verifier for C and Java
inferredcites →https://doi.org/10.1007/978-3-642-21691-6_17openalex-snapshot
Partiality, State and Dependent Types
inferredcites →https://doi.org/10.1007/978-3-642-31424-7_21openalex-snapshot
How to Prove Algorithms Linearisable
inferredcites →https://doi.org/10.1007/978-3-642-32940-1_19openalex-snapshot
Linearizability with Ownership Transfer
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-40184-8_18openalex-snapshot
Aspect-Oriented Linearizability Proofs
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-07964-5openalex-snapshot
Interactive Theorem Proving and Program Development
inferredcites →https://doi.org/10.1007/978-3-662-43951-7_19openalex-snapshot
Between Linearizability and Quiescent Consistency
inferredcites →https://doi.org/10.1007/978-3-662-43951-7_9openalex-snapshot
Parameterised Linearisability
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/978-3-662-49122-5_2openalex-snapshot
Viper: A Verification Infrastructure for Permission-Based Reasoning
inferredcites →https://doi.org/10.1007/978-3-662-54434-1_24openalex-snapshot
Proving Linearizability Using Partial Orders
inferredcites →https://doi.org/10.1007/s00165-009-0125-8openalex-snapshot
Blaming the client: on data refinement in the presence of pointers
inferredcites →https://doi.org/10.1016/0022-0000(78)90014-4openalex-snapshot
A theory of type polymorphism in programming
inferredcites →https://doi.org/10.1016/0304-3975(91)90224-popenalex-snapshot
The existence of refinement mappings
inferredcites →https://doi.org/10.1016/b978-1-4832-0016-3.50006-8openalex-snapshot
ALGEBRAIC FOUNDATIONS FOR AUTOMATA THEORY
inferredcites →https://doi.org/10.1016/c2011-0-06993-4openalex-snapshot
The Art of Multiprocessor Programming
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.1016/j.tcs.2010.09.021openalex-snapshot
Abstraction for concurrent objects
inferredcites →https://doi.org/10.1016/s0304-3975(00)00056-6openalex-snapshot
Universal coalgebra: a theory of systems
inferredcites →https://doi.org/10.1017/9781316823187openalex-snapshot
Introduction to Coalgebra: Towards Mathematics of States and Observation
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.1017/s0960129512000035openalex-snapshot
A step-indexed Kripke model of hidden state
inferredcites →https://doi.org/10.1108/03684920810907904openalex-snapshot
The Art of Multiprocessor Programming
inferredcites →https://doi.org/10.1109/lics.2001.932499openalex-snapshot
Intensionality, extensionality, and proof irrelevance in modal type theory
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.2008.16openalex-snapshot
Hiding Local State in Direct Style: A Higher-Order Anti-Frame Rule
inferredcites →https://doi.org/10.1145/103727.103729openalex-snapshot
Algorithms for scalable synchronization on shared-memory multiprocessors
inferredcites →https://doi.org/10.1145/1040305.1040327openalex-snapshot
Permission accounting in separation logic
inferredcites →https://doi.org/10.1145/1159803.1159812openalex-snapshot
Polymorphism and separation in hoare type theory
inferredcites →https://doi.org/10.1145/1810479.1810540openalex-snapshot
Flat combining and the synchronization-parallelism tradeoff
inferredcites →https://doi.org/10.1145/1889997.1890001openalex-snapshot
Mechanically verified proof obligations for linearizability
inferredcites →https://doi.org/10.1145/1925844.1926417openalex-snapshot
Expressive modular fine-grained concurrency specification
inferredcites →https://doi.org/10.1145/2103621.2103711openalex-snapshot
A rely-guarantee-based simulation for verifying concurrent program transformations
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/2429069.2429134openalex-snapshot
Subjective auxiliary state for coarse-grained concurrency
inferredcites →https://doi.org/10.1145/2491956.2462189openalex-snapshot
Modular verification of linearizability with non-fixed linearization points
inferredcites →https://doi.org/10.1145/2499370.2462189openalex-snapshot
Modular verification of linearizability with non-fixed linearization points
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/2544174.2500600openalex-snapshot
Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency
inferredcites →https://doi.org/10.1145/2603088.2603123openalex-snapshot
Compositional verification of termination-preserving refinement of concurrent programs
inferredcites →https://doi.org/10.1145/2676726.2676975openalex-snapshot
Deep Specifications and Certified Abstraction Layers
inferredcites →https://doi.org/10.1145/2737924.2737964openalex-snapshot
Mechanized verification of fine-grained concurrent programs
inferredcites →https://doi.org/10.1145/2983990.2983999openalex-snapshot
Hoare-style specifications as correctness conditions for non-linearizable concurrent objects
inferredcites →https://doi.org/10.1145/3022671.2983999openalex-snapshot
Hoare-style specifications as correctness conditions for non-linearizable concurrent objects
inferredcites →https://doi.org/10.1145/3158108openalex-snapshot
Progress of concurrent objects with partial methods
inferredcites →https://doi.org/10.1145/3158116openalex-snapshot
Programming and proving with distributed protocols
inferredcites →https://doi.org/10.1145/3192366.3192381openalex-snapshot
Certified concurrent abstraction layers
inferredcites →https://doi.org/10.1145/3290316openalex-snapshot
Definitional proof-irrelevance without K
inferredcites →https://doi.org/10.1145/3290378openalex-snapshot
Iron: managing obligations in higher-order concurrent separation logic
inferredcites →https://doi.org/10.1145/3360587openalex-snapshot
Specifying concurrent programs in separation logic: morphisms and simulations
inferredcites →https://doi.org/10.1145/360051.360224openalex-snapshot
Verifying properties of parallel programs
inferredcites →https://doi.org/10.1145/362759.362813openalex-snapshot
Concurrent control with “readers” and “writers”
inferredcites →https://doi.org/10.1145/69575.69577openalex-snapshot
Tentative steps toward a development method for interfering programs
inferredcites →https://doi.org/10.1145/78969.78972openalex-snapshot
Linearizability: a correctness condition for concurrent objects
inferredcites →https://doi.org/10.4204/eptcs.272.9openalex-snapshot
Verification of Shared-Reading Synchronisers
inferredcites →https://doi.org/10.4230/lipics.ecoop.2017.8openalex-snapshot
Concurrent Data Structures Linked in Time
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-030-67067-2_8openalex-snapshot
Concurrent Correctness in Vector Space
inferred← citeshttps://doi.org/10.1007/978-3-030-88806-0_18openalex-snapshot
Improving Thread-Modular Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/978-3-031-98668-0_4openalex-snapshot
Raven: An SMT-Based Concurrency Verifier
inferred← citeshttps://doi.org/10.1007/s00607-022-01092-3openalex-snapshot
Quantifiability: a concurrent correctness condition modeled in vector space
inferred← citeshttps://doi.org/10.1145/3409003openalex-snapshot
SteelCore: an extensible concurrent separation logic for effectful dependently typed programs
inferred← citeshttps://doi.org/10.1145/3428196openalex-snapshot
Proving highly-concurrent traversals correct
inferred← citeshttps://doi.org/10.1145/3434286openalex-snapshot
On algebraic abstractions for concurrent separation logics
inferred← citeshttps://doi.org/10.1145/3473590openalex-snapshot
Steel: proof-oriented programming in a dependently typed concurrent separation logic
inferred← citeshttps://doi.org/10.1145/3547631openalex-snapshot
Later credits: resourceful reasoning for the later modality
inferred← citeshttps://doi.org/10.1145/3571229openalex-snapshot
Higher-Order Leak and Deadlock Free Locks
inferred← citeshttps://doi.org/10.1145/3586043openalex-snapshot
Proof Automation for Linearizability in Separation Logic
inferred← citeshttps://doi.org/10.1145/3649857openalex-snapshot
Scenario-Based Proofs for Concurrent Objects
inferred← citeshttps://doi.org/10.1145/3729311openalex-snapshot
PulseCore: An Impredicative Concurrent Separation Logic for Dependently Typed Programs
inferred← citeshttps://doi.org/10.1145/3747510openalex-snapshot
Verifying Graph Algorithms in Separation Logic: A Case for an Algebraic Approach
inferred← citeshttps://doi.org/10.48550/arxiv.1905.06421openalex-snapshot
Quantifiability: Concurrent Correctness from First Principles
inferred← citeshttps://doi.org/10.70675/95fceee8z06bbz48ccz8b06z87fb9e672ea8openalex-snapshot
Proof-oriented domain-specific language design for high-assurance software
showing the first 16 of 17 · page through all 17
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.