On the public citation graph

Almost-Sure Termination by Guarded Refinement

https://doi.org/10.1145/3674632
0 signed · 69 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-36576-1_6openalex-snapshot
Parameterized Verification by Probabilistic Abstraction
inferredcites →https://doi.org/10.1007/3-540-45685-6_16openalex-snapshot
A Formal Approach to Probabilistic Termination
inferredcites →https://doi.org/10.1007/978-1-4612-1236-2openalex-snapshot
Coupling, Stationarity, and Regeneration
inferredcites →https://doi.org/10.1007/978-1-4614-6956-8openalex-snapshot
Measure Theory: Second Edition
inferredcites →https://doi.org/10.1007/978-1-4684-6257-9openalex-snapshot
Principles of Random Walk
inferredcites →https://doi.org/10.1007/978-3-030-11245-5_22openalex-snapshot
Termination of Nondeterministic Probabilistic Programs
inferredcites →https://doi.org/10.1007/978-3-030-17184-1_1openalex-snapshot
Time Credits and Time Receipts in Iris
inferredcites →https://doi.org/10.1007/978-3-319-89884-1_8openalex-snapshot
Relational Reasoning for Markov Chains in a Probabilistic Guarded Lambda Calculus
inferredcites →https://doi.org/10.1007/978-3-540-32033-3_24openalex-snapshot
Proving Positive Almost-Sure Termination
inferredcites →https://doi.org/10.1007/978-3-540-71050-9openalex-snapshot
Optimal Transport: Old and New
inferredcites →https://doi.org/10.1007/978-3-642-22110-1_47openalex-snapshot
PRISM 4.0: Verification of Probabilistic Real-Time Systems
inferredcites →https://doi.org/10.1007/978-3-642-31424-7_14openalex-snapshot
Proving Termination of Probabilistic Programs Using Patterns
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_34openalex-snapshot
Probabilistic Program Analysis with Martingales
inferredcites →https://doi.org/10.1007/978-3-642-65371-1openalex-snapshot
Branching Processes
inferredcites →https://doi.org/10.1007/978-3-662-46678-0_18openalex-snapshot
Step-Indexed Logical Relations for Probability
inferredcites →https://doi.org/10.1007/978-3-662-49498-1_15openalex-snapshot
Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs
inferredcites →https://doi.org/10.1007/978-3-662-49498-1_28openalex-snapshot
Transfinite Step-Indexing: Decoupling Concrete and Logical Steps
inferredcites →https://doi.org/10.1007/978-3-662-54434-1_15openalex-snapshot
Probabilistic Termination by Monadic Affine Sized Typing
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/bf01940876openalex-snapshot
Randomized search trees
inferredcites →https://doi.org/10.1007/s00236-018-0321-1openalex-snapshot
On the hardness of analyzing probabilistic programs
inferredcites →https://doi.org/10.1007/s10703-012-0166-0openalex-snapshot
Analyzing probabilistic pushdown automata
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.1007/s10817-020-09545-0openalex-snapshot
Verified Analysis of Random Binary Tree Structures
inferredcites →https://doi.org/10.1007/s11786-014-0181-1openalex-snapshot
Coquelicot: A User-Friendly Library of Real Analysis for Coq
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.1093/comjnlopenalex-snapshot
Design And Evaluation Of A Distributed Clustering Algorithm For Mobile Ad Hoc Networks
inferredcites →https://doi.org/10.1109/lics.2000.855774openalex-snapshot
A modality for recursion
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.2019.8785679openalex-snapshot
On the Termination Problem for Probabilistic Higher-Order Recursive Programs
inferredcites →https://doi.org/10.1109/sp40001.2021.00003openalex-snapshot
Compositional Non-Interference for Fine-Grained Concurrent Programs
inferredcites →https://doi.org/10.1137/090766632openalex-snapshot
Simulating Size-constrained Galton–Watson Trees
inferredcites →https://doi.org/10.1145/1190216.1190235openalex-snapshot
A very modal model of a modern, major, general type system
inferredcites →https://doi.org/10.1145/1462153.1462154openalex-snapshot
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
inferredcites →https://doi.org/10.1145/1480881.1480894openalex-snapshot
Formal certification of code-based cryptographic proofs
inferredcites →https://doi.org/10.1145/2166.357214openalex-snapshot
Termination of Probabilistic Concurrent Program
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/2676726.2677001openalex-snapshot
Probabilistic Termination
inferredcites →https://doi.org/10.1145/3158121openalex-snapshot
A new proof rule for almost-sure termination
inferredcites →https://doi.org/10.1145/3158122openalex-snapshot
Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs
inferredcites →https://doi.org/10.1145/3192366.3192394openalex-snapshot
Bounded expectations: resource analysis for probabilistic programs
inferredcites →https://doi.org/10.1145/3236782openalex-snapshot
Contextual equivalence for a probabilistic language with continuous random variables and recursion
inferredcites →https://doi.org/10.1145/3290377openalex-snapshot
A separation logic for concurrent randomized programs
inferredcites →https://doi.org/10.1145/3408992openalex-snapshot
Raising expectations: automating expected cost analysis with types
inferredcites →https://doi.org/10.1145/3434291openalex-snapshot
Mechanized logical relations for termination-insensitive noninterference
inferredcites →https://doi.org/10.1145/3434294openalex-snapshot
Transfinite step-indexing for termination
inferredcites →https://doi.org/10.1145/3434313openalex-snapshot
Intersection types and (positive) almost-sure termination
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/3473592openalex-snapshot
On continuation-passing transformations and expected cost analysis
inferredcites →https://doi.org/10.1145/3571195openalex-snapshot
Step-Indexed Logical Relations for Countable Nondeterminism and Probabilistic Choice
inferredcites →https://doi.org/10.1145/3586051openalex-snapshot
Lower Bounds for Possibly Divergent Probabilistic Programs
inferredcites →https://doi.org/10.1145/3632851openalex-snapshot
Trillium: Higher-Order Concurrent and Distributed Separation Logic for Intensional Refinement
inferredcites →https://doi.org/10.1145/3632868openalex-snapshot
Asynchronous Probabilistic Couplings in Higher-Order Separation Logic
inferredcites →https://doi.org/10.1145/3632879openalex-snapshot
Positive Almost-Sure Termination: Complexity and Proof Rules
inferredcites →https://doi.org/10.1145/3632892openalex-snapshot
Thunks and Debits in Separation Logic with Time Credits
inferredcites →https://doi.org/10.1145/3676954openalex-snapshot
A Logical Approach to Type Soundness
inferredcites →https://doi.org/10.2140/pjm.1955.5.285openalex-snapshot
A lattice-theoretical fixpoint theorem and its applications
inferredcites →https://doi.org/10.2168/lmcs-7(2:16)2011openalex-snapshot
Logical Step-Indexed Logical Relations
inferredcites →https://doi.org/10.2168/lmcs-7(2:17)2011openalex-snapshot
Amortised Resource Analysis with Separation Logic
inferredcites →https://doi.org/10.2168/lmcs-8(4:1)2012openalex-snapshot
First steps in synthetic guarded domain theory: step-indexing in the topos of trees
inferredcites →https://doi.org/10.2307/2348358openalex-snapshot
Lectures on the Coupling Method.
inferredcites →https://doi.org/10.46298/lmcs-17(3:9)2021openalex-snapshot
ReLoC Reloaded: A Mechanized Relational Logic for Fine-Grained Concurrency and Logical Atomicity
inferredcites →https://doi.org/10.5281/zenodo.1003420openalex-snapshot
The Coq Proof Assistant
inferredcites →https://doi.org/10.5281/zenodo.11481247openalex-snapshot
Almost-Sure Termination by Guarded Refinement - Coq Artifact

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.11481248zenodo-depositor-declared
inferred← citeshttps://doi.org/10.1145/3689753openalex-snapshot
Tachis: Higher-Order Separation Logic with Credits for Expected Costs
inferred← citeshttps://doi.org/10.1145/3776651openalex-snapshot
Probabilistic Concurrent Reasoning in Outcome Logic: Independence, Conditioning, and Invariants
inferred← citeshttps://doi.org/10.1145/3828682openalex-snapshot
Completeness of Iris-Based Program Logics
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.