On the public citation graph

Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time

https://doi.org/10.1145/3371093
0 signed · 53 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/11681878_14openalex-snapshot
Calibrating Noise to Sensitivity in Private Data Analysis
inferredcites →https://doi.org/10.1007/3-540-49213-5_14openalex-snapshot
Modular Model Checking
inferredcites →https://doi.org/10.1007/978-1-4419-8853-9openalex-snapshot
Introductory Lectures on Convex Optimization
inferredcites →https://doi.org/10.1007/978-1-4471-3267-7openalex-snapshot
Markov Chains and Stochastic Stability
inferredcites →https://doi.org/10.1007/978-3-030-01090-4_23openalex-snapshot
PSense: Automatic Sensitivity Analysis for Probabilistic Programs
inferredcites →https://doi.org/10.1007/978-3-030-02768-1_11openalex-snapshot
New Approaches for Almost-Sure Termination of Probabilistic Programs
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-319-41528-4_1openalex-snapshot
Termination Analysis of Probabilistic Programs Through Positivstellensatz’s
inferredcites →https://doi.org/10.1007/978-3-319-56620-7_19openalex-snapshot
Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model
inferredcites →https://doi.org/10.1007/978-3-319-68167-2_26openalex-snapshot
Finding Polynomial Loop Invariants for Probabilistic Programs
inferredcites →https://doi.org/10.1007/978-3-642-28729-9_18openalex-snapshot
Robustness of Structurally Equivalent Concurrent Parity Games
inferredcites →https://doi.org/10.1007/978-3-642-31585-5_23openalex-snapshot
Computing Game Metrics on Markov Decision Processes
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.1016/0022-0000(85)90012-1openalex-snapshot
A probabilistic PDL
inferredcites →https://doi.org/10.1016/j.tcs.2003.09.013openalex-snapshot
Metrics for labelled Markov processes
inferredcites →https://doi.org/10.1016/j.tcs.2006.05.021openalex-snapshot
Approximating and computing behavioural distances in probabilistic transition systems
inferredcites →https://doi.org/10.1017/cbo9780511813658openalex-snapshot
Probability with Martingales
inferredcites →https://doi.org/10.1109/tcad.2015.2424951openalex-snapshot
Quantitative Masking Strength: Quantifying the Power Side-Channel Resistance of Software Code
inferredcites →https://doi.org/10.1145/1102351openalex-snapshot
Proceedings of the 22nd international conference on Machine learning - ICML '05
inferredcites →https://doi.org/10.1145/1480881.1480894openalex-snapshot
Formal certification of code-based cryptographic proofs
inferredcites →https://doi.org/10.1145/1706299.1706308openalex-snapshot
Continuity analysis of programs
inferredcites →https://doi.org/10.1145/1863543.1863568openalex-snapshot
Distance makes the types grow stronger
inferredcites →https://doi.org/10.1145/2103656.2103670openalex-snapshot
Probabilistic relational reasoning for differential privacy
inferredcites →https://doi.org/10.1145/229542.229547openalex-snapshot
Probabilistic predicate transformers
inferredcites →https://doi.org/10.1145/2429069.2429113openalex-snapshot
Linear dependent types for differential privacy
inferredcites →https://doi.org/10.1145/3009837.3009890openalex-snapshot
A semantic account of metric preservation
inferredcites →https://doi.org/10.1145/3009837.3009896openalex-snapshot
Coupling proofs are probabilistic product programs
inferredcites →https://doi.org/10.1145/3110254openalex-snapshot
A framework for adaptive differential privacy
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/3158145openalex-snapshot
Proving expected sensitivity of probabilistic programs
inferredcites →https://doi.org/10.1145/3174800openalex-snapshot
Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs
inferredcites →https://doi.org/10.1145/3192366.3192394openalex-snapshot
Bounded expectations: resource analysis for probabilistic programs
inferredcites →https://doi.org/10.1145/3314221.3314581openalex-snapshot
Cost analysis of nondeterministic probabilistic programs
inferredcites →https://doi.org/10.1162/153244302760200704openalex-snapshot
10.1162/153244302760200704
inferredcites →https://doi.org/10.1561/0400000042openalex-snapshot
The Algorithmic Foundations of Differential Privacy
inferredcites →https://doi.org/10.2307/2288674openalex-snapshot
Probability and Measure.
inferredcites →https://doi.org/10.24963/ijcai.2018/653openalex-snapshot
Computational Approaches for Stochastic Shortest Path on Succinct MDPs
inferredcites →https://doi.org/10.3166/ejc.16.624-641openalex-snapshot
Approximate Model Checking of Stochastic Hybrid Systems

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-45332-8_16openalex-snapshot
AquaSense: Automated Sensitivity Analysis of Probabilistic Programs via Quantized Inference
inferred← citeshttps://doi.org/10.1007/978-3-031-47705-8_2openalex-snapshot
Automated Sensitivity Analysis for Probabilistic Loops
inferred← citeshttps://doi.org/10.1007/978-3-031-90653-4_14openalex-snapshot
Refuting Equivalence in Probabilistic Programs with Conditioning
inferred← citeshttps://doi.org/10.1007/s12204-022-2456-zopenalex-snapshot
Tail-Bound Cost Analysis over Nondeterministic Probabilistic Programs
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104634openalex-snapshot
Time-bounded termination analysis for probabilistic programs with delays
inferred← citeshttps://doi.org/10.1145/3434333openalex-snapshot
A pre-expectation calculus for probabilistic sensitivity
inferred← citeshttps://doi.org/10.1145/3453483.3454102openalex-snapshot
Quantitative analysis of assertion violations in probabilistic programs
inferred← citeshttps://doi.org/10.1145/3468264.3468615openalex-snapshot
FLEX: fixing flaky tests in machine learning projects by updating assertion bounds
inferred← citeshttps://doi.org/10.1145/3547643openalex-snapshot
Safe couplings: coupled refinement types
inferred← citeshttps://doi.org/10.1145/3649824openalex-snapshot
Quantitative Bounds on Resource Usage of Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3656432openalex-snapshot
Static Posterior Inference of Bayesian Probabilistic Programming via Polynomial Solving
inferred← citeshttps://doi.org/10.1145/3656462openalex-snapshot
Equivalence and Similarity Refutation for Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3704876openalex-snapshot
A Quantitative Probabilistic Relational Hoare Logic
inferred← citeshttps://doi.org/10.1145/3808296openalex-snapshot
SuperDP: Differential Privacy Refutation via Supermartingales
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.