On the public citation graph

Program Logics à la Carte

https://doi.org/10.1145/3704847
0 signed · 47 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/978-3-030-81685-8_14openalex-snapshot
Isla: Integrating Full-Scale ISA Semantics and Axiomatic Concurrency Models
inferredcites →https://doi.org/10.1007/978-3-540-24615-2_12openalex-snapshot
Binary Multirelations
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-15375-4_27openalex-snapshot
Reasoning about Optimistic Concurrency Using a Program Logic for History
inferredcites →https://doi.org/10.1007/978-3-642-39038-8_14openalex-snapshot
Joins: A Case Study in Modular Specification of a Concurrent Reentrant Higher-Order Library
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.1016/j.tcs.2006.12.035openalex-snapshot
Resources, concurrency, and local reasoning
inferredcites →https://doi.org/10.1016/j.tcs.2015.03.020openalex-snapshot
Dijkstra and Hoare monads in monadic computation
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/csf.2016.8openalex-snapshot
Modular Verification for Computer Security
inferredcites →https://doi.org/10.1109/lics.2007.30openalex-snapshot
Local Action and Abstract Separation Logic
inferredcites →https://doi.org/10.1145/1706299.1706339openalex-snapshot
Programming with angelic nondeterminism
inferredcites →https://doi.org/10.1145/2429069.2429104openalex-snapshot
Views
inferredcites →https://doi.org/10.1145/2491956.2491978openalex-snapshot
Verifying higher-order programs with the dijkstra monad
inferredcites →https://doi.org/10.1145/2660193.2660243openalex-snapshot
GPS
inferredcites →https://doi.org/10.1145/3009837.3009855openalex-snapshot
Interactive proofs in higher-order concurrent separation logic
inferredcites →https://doi.org/10.1145/3009837.3009878openalex-snapshot
Dijkstra monads for free
inferredcites →https://doi.org/10.1145/3133911openalex-snapshot
A verified messaging system
inferredcites →https://doi.org/10.1145/3158154openalex-snapshot
RustBelt: securing the foundations of the Rust programming language
inferredcites →https://doi.org/10.1145/321420.321422openalex-snapshot
Nondeterministic Algorithms
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/3341708openalex-snapshot
Dijkstra monads for all
inferredcites →https://doi.org/10.1145/3371113openalex-snapshot
The future is ours: prophecy variables in separation logic
inferredcites →https://doi.org/10.1145/3371119openalex-snapshot
Interaction trees: representing recursive and impure programs in Coq
inferredcites →https://doi.org/10.1145/3434307openalex-snapshot
Dijkstra monads forever: termination-sensitive specifications for interaction trees
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/3473572openalex-snapshot
Modular, compositional, and executable formal semantics for LLVM IR
inferredcites →https://doi.org/10.1145/3519939.3523434openalex-snapshot
Islaris: verification of machine code against authoritative ISA semantics
inferredcites →https://doi.org/10.1145/3547631openalex-snapshot
Later credits: resourceful reasoning for the later modality
inferredcites →https://doi.org/10.1145/3563337openalex-snapshot
A concurrent program logic with a future and history
inferredcites →https://doi.org/10.1145/3571220openalex-snapshot
DimSum: A Decentralized Approach to Multi-language Semantics and Verification
inferredcites →https://doi.org/10.1145/3571232openalex-snapshot
Conditional Contextual Refinement
inferredcites →https://doi.org/10.1145/3571254openalex-snapshot
Choice Trees: Representing Nondeterministic, Recursive, and Impure Programs in Coq
inferredcites →https://doi.org/10.1145/3579834openalex-snapshot
Omnisemantics: Smooth Handling of Nondeterminism
inferredcites →https://doi.org/10.1145/3586045openalex-snapshot
Outcome Logic: A Unifying Foundation for Correctness and Incorrectness Reasoning
inferredcites →https://doi.org/10.1145/3600006.3613172openalex-snapshot
Grove: a Separation-Logic Library for Verifying Distributed Systems
inferredcites →https://doi.org/10.1145/3622823openalex-snapshot
Melocoton: A Program Logic for Verified Interoperability Between OCaml and C
inferredcites →https://doi.org/10.1145/3632848openalex-snapshot
An Iris Instance for Verifying CompCert C Programs
inferredcites →https://doi.org/10.1145/3632854openalex-snapshot
Modular Denotational Semantics for Effects with Guarded Interaction Trees
inferredcites →https://doi.org/10.1145/3632889openalex-snapshot
Deadlock-Free Separation Logic: Linearity Yields Progress for Dependent Higher-Order Message Passing
inferredcites →https://doi.org/10.5281/zenodo.13939385openalex-snapshot
Artifact of "Program logics à la carte"

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← backgroundhttps://doi.org/10.5281/zenodo.14180355zenodo-depositor-declared
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.1109/lics65433.2025.00009openalex-snapshot
Syntactic Effectful Realizability in Higher-Order Logic
inferred← citeshttps://doi.org/10.1145/3747509openalex-snapshot
Formal Semantics and Program Logics for a Fragment of OCaml
inferred← citeshttps://doi.org/10.1145/3776719openalex-snapshot
Foundational Multi-Modal Program Verifiers
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.