On the public citation graph

Error Credits: Resourceful Reasoning about Error Bounds for Higher-Order Probabilistic Programs

https://doi.org/10.1145/3674635
0 signed · 54 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-48184-2_32openalex-snapshot
A Digital Signature Based on a Conventional Encryption Function
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-031-26212-8_4openalex-snapshot
Introduction to Algorithms
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-662-48899-7_27openalex-snapshot
Relational Reasoning via Probabilistic Coupling
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/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/s11786-014-0181-1openalex-snapshot
Coquelicot: A User-Friendly Library of Real Analysis for Coq
inferredcites →https://doi.org/10.1016/0022-314x(80)90084-0openalex-snapshot
Probabilistic algorithm for testing primality
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/s0960129521000487openalex-snapshot
Two decades of automatic amortized resource analysis
inferredcites →https://doi.org/10.1137/0206006openalex-snapshot
A Fast Monte-Carlo Test for Primality
inferredcites →https://doi.org/10.1145/1294261.1294281openalex-snapshot
Dynamo
inferredcites →https://doi.org/10.1145/168588.168596openalex-snapshot
Random oracles are practical
inferredcites →https://doi.org/10.1145/229542.229547openalex-snapshot
Probabilistic predicate transformers
inferredcites →https://doi.org/10.1145/2509136.2509546openalex-snapshot
Verifying quantitative reliability for programs that execute on unreliable hardware
inferredcites →https://doi.org/10.1145/2676726.2676980openalex-snapshot
Iris
inferredcites →https://doi.org/10.1145/2976749.2978391openalex-snapshot
Advanced Probabilistic Couplings for Differential Privacy
inferredcites →https://doi.org/10.1145/3009837.3009855openalex-snapshot
Interactive proofs in higher-order concurrent separation logic
inferredcites →https://doi.org/10.1145/3022670.2951943openalex-snapshot
Higher-order ghost state
inferredcites →https://doi.org/10.1145/3158121openalex-snapshot
A new proof rule for almost-sure termination
inferredcites →https://doi.org/10.1145/3192366.3192394openalex-snapshot
Bounded expectations: resource analysis for probabilistic programs
inferredcites →https://doi.org/10.1145/3290347openalex-snapshot
Quantitative separation logic: a logic for reasoning about probabilistic pointer programs
inferredcites →https://doi.org/10.1145/3290351openalex-snapshot
Formal verification of higher-order probabilistic programs: reasoning about approximation, convergence, Bayesian inference, and optimization
inferredcites →https://doi.org/10.1145/3290352openalex-snapshot
Trace abstraction modulo probability
inferredcites →https://doi.org/10.1145/3290377openalex-snapshot
A separation logic for concurrent randomized programs
inferredcites →https://doi.org/10.1145/3371123openalex-snapshot
A probabilistic separation logic
inferredcites →https://doi.org/10.1145/3408992openalex-snapshot
Raising expectations: automating expected cost analysis with types
inferredcites →https://doi.org/10.1145/3453483.3454102openalex-snapshot
Quantitative analysis of assertion violations in probabilistic programs
inferredcites →https://doi.org/10.1145/3473598openalex-snapshot
Higher-order probabilistic adversarial computations: categorical semantics and program logics
inferredcites →https://doi.org/10.1145/3498719openalex-snapshot
A separation logic for negative dependence
inferredcites →https://doi.org/10.1145/3547631openalex-snapshot
Later credits: resourceful reasoning for the later modality
inferredcites →https://doi.org/10.1145/3571259openalex-snapshot
Probabilistic Resource-Aware Session Types
inferredcites →https://doi.org/10.1145/3571260openalex-snapshot
A Calculus for Amortized Expected Runtimes
inferredcites →https://doi.org/10.1145/3591226openalex-snapshot
Lilac: A Modal Separation Logic for Conditional Probability
inferredcites →https://doi.org/10.1145/3622870openalex-snapshot
A Deductive Verification Infrastructure for Probabilistic Programs
inferredcites →https://doi.org/10.1145/3632868openalex-snapshot
Asynchronous Probabilistic Couplings in Higher-Order Separation Logic
inferredcites →https://doi.org/10.1145/3632892openalex-snapshot
Thunks and Debits in Separation Logic with Time Credits
inferredcites →https://doi.org/10.1145/604131.604148openalex-snapshot
Static prediction of heap space usage for first-order functional programs
inferredcites →https://doi.org/10.1145/800116.803773openalex-snapshot
Riemann's Hypothesis and tests for primality
inferredcites →https://doi.org/10.2168/lmcs-7(2:17)2011openalex-snapshot
Amortised Resource Analysis with Separation Logic
inferredcites →https://doi.org/10.5281/zenodo.11489777openalex-snapshot
Error Credits: Resourceful Reasoning about Error Bounds for Higher-Order Probabilistic Programs - 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.11489778zenodo-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/3704855openalex-snapshot
A Demonic Outcome Logic for Randomized Nondeterminism
inferred← citeshttps://doi.org/10.1145/3704877openalex-snapshot
Approximate Relational Reasoning for Higher-Order Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3729317openalex-snapshot
Probabilistic Refinement Session Types
inferred← citeshttps://doi.org/10.1145/3747514openalex-snapshot
Modular Reasoning about Error Bounds for Concurrent Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3758316.3762818openalex-snapshot
Separation Logics for Probability, Concurrency, and Security
inferred← citeshttps://doi.org/10.1145/3776651openalex-snapshot
Probabilistic Concurrent Reasoning in Outcome Logic: Independence, Conditioning, and Invariants
inferred← citeshttps://doi.org/10.1145/3779031.3779109openalex-snapshot
Modular Specifications and Implementations of Random Samplers in Higher-Order Separation Logic
inferred← citeshttps://doi.org/10.1145/3808265openalex-snapshot
Contextual Refinement of Higher-Order Concurrent Probabilistic Programs
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.