On the public citation graph
Simuliris: a separation logic framework for verifying concurrent program optimizations
0 signed · 75 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/3-540-10843-2_22openalex-snapshot
Impartiality, justice and fairness: The ethics of concurrent termination
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-642-54833-8_7openalex-snapshot
Verified Compilation for Shared-Memory C
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-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.1016/j.tcs.2006.12.036openalex-snapshot
Relational separation logic
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.1145/1040305.1040327openalex-snapshot
Permission accounting in separation logic
inferredcites →https://doi.org/10.1145/1111037.1111042openalex-snapshot
Formal certification of a compiler back-end or
inferredcites →https://doi.org/10.1145/1538788.1538814openalex-snapshot
Formal verification of a realistic compiler
inferredcites →https://doi.org/10.1145/1993498.1993534openalex-snapshot
Safe optimisations for shared-memory concurrent programs
inferredcites →https://doi.org/10.1145/2103656.2103666openalex-snapshot
The marriage of bisimulations and Kripke logical relations
inferredcites →https://doi.org/10.1145/2429069.2429093openalex-snapshot
The power of parameterization in coinductive proof
inferredcites →https://doi.org/10.1145/2491956.2491967openalex-snapshot
Compiler testing via a theory of sound optimisations in the C11/C++11 memory model
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/2676726.2676995openalex-snapshot
Common Compiler Optimisations are Invalid in the C11 Memory Model and what we can do about it
inferredcites →https://doi.org/10.1145/2737924.2738005openalex-snapshot
A formal C memory model supporting integer-pointer casts
inferredcites →https://doi.org/10.1145/2837614.2837635openalex-snapshot
A program logic for concurrent objects under fair scheduling
inferredcites →https://doi.org/10.1145/3009837.3009850openalex-snapshot
A promising semantics for relaxed-memory concurrency
inferredcites →https://doi.org/10.1145/3009837.3009855openalex-snapshot
Interactive proofs in higher-order concurrent separation logic
inferredcites →https://doi.org/10.1145/3062341.3062343openalex-snapshot
Taming undefined behavior in LLVM
inferredcites →https://doi.org/10.1145/3158108openalex-snapshot
Progress of concurrent objects with partial methods
inferredcites →https://doi.org/10.1145/3158154openalex-snapshot
RustBelt: securing the foundations of the Rust programming language
inferredcites →https://doi.org/10.1145/3192366.3192381openalex-snapshot
Certified concurrent abstraction layers
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/3314221.3314595openalex-snapshot
Towards certified separate compilation for concurrent programs
inferredcites →https://doi.org/10.1145/3371109openalex-snapshot
Stacked borrows: an aliasing model for Rust
inferredcites →https://doi.org/10.1145/3371119openalex-snapshot
Interaction trees: representing recursive and impure programs in Coq
inferredcites →https://doi.org/10.1145/3453483.3454031openalex-snapshot
Transfinite Iris: resolving an existential dilemma of step-indexed separation logic
inferredcites →https://doi.org/10.1145/3453483.3454036openalex-snapshot
RefinedC: automating the foundational verification of C code with refined ownership types
inferredcites →https://doi.org/10.1145/504709.504712openalex-snapshot
An indexed model of recursive types for foundational proof-carrying code
inferredcites →https://doi.org/10.1145/964001.964003openalex-snapshot
Simple relational correctness proofs for static analyses and program transformations
inferredcites →https://doi.org/10.5281/zenodo.5667544openalex-snapshot
Coq development for "Simuliris: A Separation Logic Framework for Verifying Concurrent Program Optimizations"
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_11openalex-snapshot
Borrowable Fractional Ownership Types for Verification
inferred← citeshttps://doi.org/10.1007/978-3-032-11176-0_7openalex-snapshot
A Rely-Guarantee-Based Simulation for Cooperative Semantics
inferred← citeshttps://doi.org/10.1145/3519939.3523718openalex-snapshot
Sequential reasoning for optimizing compilers under weak memory concurrency
inferred← citeshttps://doi.org/10.1145/3519939.3523734openalex-snapshot
Verifying optimizations of concurrent programs in the promising semantics
inferred← citeshttps://doi.org/10.1145/3571220openalex-snapshot
DimSum: A Decentralized Approach to Multi-language Semantics and Verification
inferred← citeshttps://doi.org/10.1145/3586041openalex-snapshot
Compositional Security Definitions for Higher-Order Where Declassification
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/3632868openalex-snapshot
Asynchronous Probabilistic Couplings in Higher-Order Separation Logic
inferred← citeshttps://doi.org/10.1145/3632898openalex-snapshot
Algebraic Effects Meet Hoare Logic in Cubical Agda
inferred← citeshttps://doi.org/10.1145/3704889openalex-snapshot
Coinductive Proofs for Temporal Hyperliveness
inferred← citeshttps://doi.org/10.1145/3704915openalex-snapshot
Tail Modulo Cons, OCaml, and Relational Separation Logic
inferred← citeshttps://doi.org/10.1145/3713082.3730387openalex-snapshot
Modular, Full-System Verification
inferred← citeshttps://doi.org/10.1145/3720525openalex-snapshot
Lilo: A Higher-Order, Relational Concurrent Separation Logic for Liveness
inferred← citeshttps://doi.org/10.1145/3729250openalex-snapshot
Nola: Later-Free Ghost State for Verifying Termination in Iris
inferred← citeshttps://doi.org/10.1145/3763138openalex-snapshot
Encode the ∀∃ Relational Hoare Logic into Standard Hoare Logic
inferred← citeshttps://doi.org/10.1145/3776676openalex-snapshot
A Relational Separation Logic for Effect Handlers
inferred← citeshttps://doi.org/10.1145/3776682openalex-snapshot
Endangered by the Language But Saved by the Compiler: Robust Safety via Semantic Back-Translation
inferred← citeshttps://doi.org/10.1145/3776714openalex-snapshot
A Family of Sims with Diverging Interests
inferred← citeshttps://doi.org/10.1145/3786762openalex-snapshot
An Axiomatic Basis for Computer Programming on Relaxed Hardware Architectures: The AxSL Logics
inferred← citeshttps://doi.org/10.1145/3798240openalex-snapshot
Lawyer: Modular Obligations-Based Liveness Reasoning in Higher-Order Impredicative Concurrent Separation Logic
inferred← citeshttps://doi.org/10.1145/3808251openalex-snapshot
A Deductive System for Contract Satisfaction Proofs
inferred← citeshttps://doi.org/10.1145/3808303openalex-snapshot
Backwards-Compatible Row-Based Exceptions in ML
inferred← citeshttps://doi.org/10.1145/3808317openalex-snapshot
CRIS: The Power of Imagination in Hybrid Verification
inferred← citeshttps://doi.org/10.1145/3828682openalex-snapshot
Completeness of Iris-Based Program Logics
inferred← citeshttps://doi.org/10.1145/3828683openalex-snapshot
Safety First: How to Safely Disregard Unsafe Behaviour in Compiler Calculations
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.