On the public citation graph

Dijkstra monads forever: termination-sensitive specifications for interaction trees

https://doi.org/10.1145/3434307
0 signed · 36 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-319-19797-5_13openalex-snapshot
Turing-Completeness Totally Free
inferredcites →https://doi.org/10.1007/978-3-319-63390-9_4openalex-snapshot
Automated Resource Analysis with Coq Proof Objects
inferredcites →https://doi.org/10.1007/978-3-319-95582-7_20openalex-snapshot
Modular Verification of Programs with Effects and Effect Handlers in Coq
inferredcites →https://doi.org/10.1016/j.jsc.2010.08.004openalex-snapshot
Trace-based verification of imperative programs with I/O
inferredcites →https://doi.org/10.1017/cbo9781107256552openalex-snapshot
Program Logics for Certified Compilers
inferredcites →https://doi.org/10.1017/s0956796808006758openalex-snapshot
Data types à la carte
inferredcites →https://doi.org/10.1090/psapm/019/0235771openalex-snapshot
Assigning meanings to programs
inferredcites →https://doi.org/10.1145/1160074.1159812openalex-snapshot
Polymorphism and separation in hoare type theory
inferredcites →https://doi.org/10.1145/2034773.2034811openalex-snapshot
Secure distributed programming with value-dependent types
inferredcites →https://doi.org/10.1145/2480359.2429093openalex-snapshot
The power of parameterization in coinductive proof
inferredcites →https://doi.org/10.1145/2491956.2491978openalex-snapshot
Verifying higher-order programs with the dijkstra monad
inferredcites →https://doi.org/10.1145/2813885.2737964openalex-snapshot
Mechanized verification of fine-grained concurrent programs
inferredcites →https://doi.org/10.1145/2951913.2951943openalex-snapshot
Higher-order ghost state
inferredcites →https://doi.org/10.1145/3158154openalex-snapshot
RustBelt: securing the foundations of the Rust programming language
inferredcites →https://doi.org/10.1145/3341708openalex-snapshot
Dijkstra monads for all
inferredcites →https://doi.org/10.1145/3356903openalex-snapshot
Building certified concurrent OS kernels
inferredcites →https://doi.org/10.1145/360933.360975openalex-snapshot
Guarded commands, nondeterminacy and formal derivation of programs
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.2168/lmcs-1(2:1)2005openalex-snapshot
General Recursion via Coinductive Types

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-91121-7_16openalex-snapshot
On the Relationship between Dijkstra Monads and Higher-Order Fixpoint Logic
inferred← citeshttps://doi.org/10.1093/comjnl/bxaf150openalex-snapshot
Authentication safety: safe on-demand concurrent authentication under transient faults and arbitrary initialization
inferred← citeshttps://doi.org/10.1109/csf51468.2021.00048openalex-snapshot
SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq
inferred← citeshttps://doi.org/10.1145/3546189.3549919openalex-snapshot
How to safely use extensionality in Liquid Haskell
inferred← citeshttps://doi.org/10.1145/3547632openalex-snapshot
Program adverbs and Tlön embeddings
inferred← citeshttps://doi.org/10.1145/3632898openalex-snapshot
Algebraic Effects Meet Hoare Logic in Cubical Agda
inferred← citeshttps://doi.org/10.1145/3632916openalex-snapshot
Securing Verified IO Programs Against Unverified Code in F*
inferred← citeshttps://doi.org/10.1145/3689786openalex-snapshot
Type Inference Logics
inferred← citeshttps://doi.org/10.1145/3702981openalex-snapshot
Unifying Model Execution and Deductive Verification with Interaction Trees in Isabelle/HOL
inferred← citeshttps://doi.org/10.1145/3703595.3705890openalex-snapshot
Monadic Interpreters for Concurrent Memory Models
inferred← citeshttps://doi.org/10.1145/3704847openalex-snapshot
Program Logics à la Carte
inferred← citeshttps://doi.org/10.1145/3747522openalex-snapshot
SecRef*: Securely Sharing Mutable References between Verified and Unverified Code in F*
inferred← citeshttps://doi.org/10.1145/3759164.3759352openalex-snapshot
Freer Arrows and Why You Need Them in Haskell
inferred← citeshttps://doi.org/10.1145/3759425.3763391openalex-snapshot
A Case Study on the Effectiveness of LLMs in Verification with Proof Assistants
inferred← citeshttps://doi.org/10.1145/3763091openalex-snapshot
Structural Temporal Logic for Mechanized Program Verification
inferred← citeshttps://doi.org/10.1145/3776719openalex-snapshot
Foundational Multi-Modal Program Verifiers
inferred← citeshttps://doi.org/10.4230/lipics.concur.2021.20openalex-snapshot
Formally Verified Simulations of State-Rich Processes Using Interaction Trees in Isabelle/HOL
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.