On the public citation graph

Proving expected sensitivity of probabilistic programs

https://doi.org/10.1145/3158145
0 signed · 82 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.1002/rsa.3240070205openalex-snapshot
A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
inferredcites →https://doi.org/10.1007/978-1-4612-1236-2openalex-snapshot
Coupling, Stationarity, and Regeneration
inferredcites →https://doi.org/10.1007/978-3-319-10082-1_6openalex-snapshot
EasyCrypt: A Tutorial
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-63387-9_1openalex-snapshot
Safety Verification of Deep Neural Networks
inferredcites →https://doi.org/10.1007/978-3-319-63387-9_5openalex-snapshot
Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks
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-17339-4openalex-snapshot
Analyzing Evolutionary Algorithms: The Computer Science Perspective
inferredcites →https://doi.org/10.1007/978-3-642-39212-2_8openalex-snapshot
Beyond Differential Privacy: Composition Theorems and Relational Logic for f-divergences between Probabilistic Programs
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-54110-4_20openalex-snapshot
Computer-Aided Verification for Mechanism Design
inferredcites →https://doi.org/10.1007/s00224-024-10185-9openalex-snapshot
International Colloquium on Automata, Languages and Programming (ICALP 2020)
inferredcites →https://doi.org/10.1016/0022-0000(85)90012-1openalex-snapshot
A probabilistic PDL
inferredcites →https://doi.org/10.1016/j.entcs.2016.09.043openalex-snapshot
Approximate Relational Hoare Logic for Continuous Random Samplings
inferredcites →https://doi.org/10.1089/cmb.2012.0064openalex-snapshot
A Finite Population Model of Molecular Evolution: Theory and Computation
inferredcites →https://doi.org/10.1090/s0002-9904-1976-14091-8openalex-snapshot
Fixed point theorems in probabilistic analysis
inferredcites →https://doi.org/10.1109/sfcs.1979.38openalex-snapshot
Semantics of probabilistic programs
inferredcites →https://doi.org/10.1109/sfcs.1997.646111openalex-snapshot
Path coupling: A technique for proving rapid mixing in Markov chains
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.1137/1.9781611973730.105openalex-snapshot
The Speed of Evolution
inferredcites →https://doi.org/10.1137/1.9781611974331.ch36openalex-snapshot
Evolutionary Dynamics in Finite Populations Mix Rapidly
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/2480359.2429113openalex-snapshot
Linear dependent types for differential privacy
inferredcites →https://doi.org/10.1145/2492061openalex-snapshot
Probabilistic Relational Reasoning for Differential Privacy
inferredcites →https://doi.org/10.1145/2676726.2677000openalex-snapshot
Higher-Order Approximate Relational Refinement Types for Mechanism Design and Differential Privacy
inferredcites →https://doi.org/10.1145/2746325.2746335openalex-snapshot
Really Natural Linear Indexed Type Checking
inferredcites →https://doi.org/10.1145/2775051.2677000openalex-snapshot
Higher-Order Approximate Relational Refinement Types for Mechanism Design and Differential Privacy
inferredcites →https://doi.org/10.1145/2933575.2934554openalex-snapshot
Proving Differential Privacy via Probabilistic Couplings
inferredcites →https://doi.org/10.1145/2976749.2978391openalex-snapshot
Advanced Probabilistic Couplings 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/3093333.3009890openalex-snapshot
A semantic account of metric preservation
inferredcites →https://doi.org/10.1145/3093333.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.1162/153244302760200704openalex-snapshot
10.1162/153244302760200704
inferredcites →https://doi.org/10.2307/1534724openalex-snapshot
Principles of Population Genetics
inferredcites →https://doi.org/10.4230/lipics.icalp.2017openalex-snapshot
Liftings for Differential Privacy
inferredcites →https://doi.org/10.48550/arxiv.1509.01240openalex-snapshot
Train faster, generalize better: Stability of stochastic gradient descent
inferredcites →https://doi.org/10.48550/arxiv.1603.00570openalex-snapshot
Without-Replacement Sampling for Stochastic Gradient Methods: Convergence Results and Application to Distributed Optimization
inferredcites →https://doi.org/10.48550/arxiv.1706.08605openalex-snapshot
Developing Bug-Free Machine Learning Systems With Formal Mathematics
inferredcites →https://doi.org/10.48550/arxiv.1710.09951openalex-snapshot
Probabilistic Couplings for Probabilistic Reasoning
inferredcites →https://doi.org/10.5555/1046920.1046923openalex-snapshot
Stability of Randomized Learning Algorithms

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-030-01090-4_23openalex-snapshot
PSense: Automatic Sensitivity Analysis for Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-11245-5_22openalex-snapshot
Termination of Nondeterministic Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-65474-0_13openalex-snapshot
Probabilistic Lipschitz Analysis of Neural Networks
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/978-3-032-07106-4_6openalex-snapshot
AURA: Precise Abstract Interpretation of Probabilistic Programs with Interval Data Uncertainty
inferred← citeshttps://doi.org/10.1007/978-3-319-96145-3_18openalex-snapshot
Constraint-Based Synthesis of Coupling Proofs
inferred← citeshttps://doi.org/10.1007/s12204-022-2456-zopenalex-snapshot
Tail-Bound Cost Analysis over Nondeterministic Probabilistic Programs
inferred← citeshttps://doi.org/10.1017/9781108770750.006openalex-snapshot
Probabilistic Couplings from Program Logics
inferred← citeshttps://doi.org/10.1017/9781108770750.008openalex-snapshot
Termination Analysis of Probabilistic Programs with Martingales
inferred← citeshttps://doi.org/10.1063/5.0068344openalex-snapshot
Quantum earth mover’s distance, a no-go quantum Kantorovich–Rubinstein theorem, and quantum marginal problem
inferred← citeshttps://doi.org/10.1109/csf.2018.00021openalex-snapshot
Assuming You Know: Epistemic Semantics of Relational Annotations for Expressive Flow Policies
inferred← citeshttps://doi.org/10.1109/lics.2019.8785715openalex-snapshot
Probabilistic Relational Reasoning via Metrics
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470555openalex-snapshot
Efficient Local Computation of Differential Bisimulations via Coupling and Up-to Methods
inferred← citeshttps://doi.org/10.1145/3314221.3314623openalex-snapshot
Incremental precision-preserving symbolic inference for probabilistic programs
inferred← citeshttps://doi.org/10.1145/3371089openalex-snapshot
Relational proofs for quantum programs
inferred← citeshttps://doi.org/10.1145/3371093openalex-snapshot
Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time
inferred← citeshttps://doi.org/10.1145/3434333openalex-snapshot
A pre-expectation calculus for probabilistic sensitivity
inferred← citeshttps://doi.org/10.1145/3473598openalex-snapshot
Higher-order probabilistic adversarial computations: categorical semantics and program logics
inferred← citeshttps://doi.org/10.1145/3485476openalex-snapshot
SecRSL: security separation logic for C11 release-acquire concurrency
inferred← citeshttps://doi.org/10.1145/3498680openalex-snapshot
Effectful program distancing
inferred← citeshttps://doi.org/10.1145/3498692openalex-snapshot
A relational theory of effects and coeffects
inferred← citeshttps://doi.org/10.1145/3547643openalex-snapshot
Safe couplings: coupled refinement types
inferred← citeshttps://doi.org/10.1145/3610392.3610394openalex-snapshot
Logics and Algorithms for Hyperproperties
inferred← citeshttps://doi.org/10.1145/3632868openalex-snapshot
Asynchronous Probabilistic Couplings in Higher-Order Separation Logic
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/3704877openalex-snapshot
Approximate Relational Reasoning for Higher-Order Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3704889openalex-snapshot
Coinductive Proofs for Temporal Hyperliveness
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33012662openalex-snapshot
Certifying the True Error: Machine Learning in Coq with Verified Generalization Guarantees
inferred← citeshttps://doi.org/10.4230/lipics.csl.2026.3openalex-snapshot
Modal Reasoning = Metric Reasoning, via Lawvere
inferred← citeshttps://doi.org/10.48550/arxiv.2008.00425openalex-snapshot
Concentration-Bound Analysis for Probabilistic Programs and Probabilistic Recurrence Relations
inferred← citeshttps://doi.org/10.48550/arxiv.2109.03602openalex-snapshot
SecRSL: Security Separation Logic for C11 Release-Acquire Concurrency (Extended version with technical appendices)
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.