On the public citation graph

Quantitative Bounds on Resource Usage of Probabilistic Programs

https://doi.org/10.1145/3649824
0 signed · 96 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/11889229_4openalex-snapshot
Developing and Reasoning About Probabilistic Programs in pGCL
inferredcites →https://doi.org/10.1007/3-540-47764-0_7openalex-snapshot
An Abstract Analysis of the Probabilistic Termination of 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-030-17465-1_8openalex-snapshot
Tail Probabilities for Randomized Program Runtimes via Martingales for Higher Moments
inferredcites →https://doi.org/10.1007/978-3-030-31784-3_15openalex-snapshot
Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops
inferredcites →https://doi.org/10.1007/978-3-030-72019-3_18openalex-snapshot
Automated Termination Analysis of Polynomial Probabilistic Programs
inferredcites →https://doi.org/10.1007/978-3-030-81688-9_1openalex-snapshot
Learning Probabilistic Termination Proofs
inferredcites →https://doi.org/10.1007/978-3-031-13185-1_4openalex-snapshot
Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs
inferredcites →https://doi.org/10.1007/978-3-319-08867-9_50openalex-snapshot
A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis
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-41528-4_4openalex-snapshot
PSI: Exact Symbolic Inference for Probabilistic Programs
inferredcites →https://doi.org/10.1007/978-3-319-89884-1_5openalex-snapshot
An Assertion-Based Program Logic for Probabilistic Programs
inferredcites →https://doi.org/10.1007/978-3-319-89884-1_7openalex-snapshot
How long, O Bayesian network, will I sample thee?
inferredcites →https://doi.org/10.1007/978-3-540-27864-1_7openalex-snapshot
Constraint-Based Linear-Relations Analysis
inferredcites →https://doi.org/10.1007/978-3-540-74407-8_28openalex-snapshot
Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes
inferredcites →https://doi.org/10.1007/978-3-540-78800-3_24openalex-snapshot
Z3: An Efficient SMT Solver
inferredcites →https://doi.org/10.1007/978-3-642-00596-1_26openalex-snapshot
Delayed Nondeterminism in Continuous-Time Markov Decision Processes
inferredcites →https://doi.org/10.1007/978-3-642-11957-6_16openalex-snapshot
Amortized Resource Analysis with Polynomial Potential
inferredcites →https://doi.org/10.1007/978-3-642-15769-1_8openalex-snapshot
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
inferredcites →https://doi.org/10.1007/978-3-642-23702-7_22openalex-snapshot
Bound Analysis of Imperative Programs with the Size-Change Abstraction
inferredcites →https://doi.org/10.1007/978-3-642-31424-7_64openalex-snapshot
Resource Aware ML
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-7091-3406-1_6openalex-snapshot
Quantifier Elimination for Real Closed Fields: A Guide to the Literature
inferredcites →https://doi.org/10.1007/b138392openalex-snapshot
Abstraction, Refinement and Proof for Probabilistic Systems
inferredcites →https://doi.org/10.1007/s10817-016-9402-4openalex-snapshot
Complexity and Resource Bound Analysis of Imperative Programs Using Difference Constraints
inferredcites →https://doi.org/10.1016/0022-0000(81)90036-2openalex-snapshot
Semantics of probabilistic programs
inferredcites →https://doi.org/10.1016/j.entcs.2010.09.014openalex-snapshot
Accelerated Invariant Generation for C Programs with Aspic and C2fsm
inferredcites →https://doi.org/10.1016/j.future.2019.03.002openalex-snapshot
Block withholding game among bitcoin mining pools
inferredcites →https://doi.org/10.1016/s0019-9958(84)80039-xopenalex-snapshot
A decidable propositional dynamic logic with explicit probabilities
inferredcites →https://doi.org/10.1016/s0747-7171(10)80005-7openalex-snapshot
On the computational complexity and geometry of the first-order theory of the reals. Part III: Quantifier elimination
inferredcites →https://doi.org/10.1017/cbo9780511813658openalex-snapshot
Probability with Martingales
inferredcites →https://doi.org/10.1038/nature14541openalex-snapshot
Probabilistic machine learning and artificial intelligence
inferredcites →https://doi.org/10.1080/00029890.2004.11920059openalex-snapshot
Solving Inequalities and Proving Farkas's Lemma Made Easy
inferredcites →https://doi.org/10.1109/lics52264.2021.9470550openalex-snapshot
Supermartingales, Ranking Functions and Probabilistic Lambda Calculus
inferredcites →https://doi.org/10.1109/tifs.2016.2623588openalex-snapshot
Bitcoin Block Withholding Attack: Analysis and Mitigation
inferredcites →https://doi.org/10.1145/1480881.1480894openalex-snapshot
Formal certification of code-based cryptographic proofs
inferredcites →https://doi.org/10.1145/1480881.1480898openalex-snapshot
SPEED
inferredcites →https://doi.org/10.1145/1806596.1806630openalex-snapshot
The reachability-bound problem
inferredcites →https://doi.org/10.1145/2362389.2362393openalex-snapshot
Multivariate amortized resource analysis
inferredcites →https://doi.org/10.1145/2593882.2593900openalex-snapshot
Probabilistic programming
inferredcites →https://doi.org/10.1145/2676726.2677001openalex-snapshot
Probabilistic Termination
inferredcites →https://doi.org/10.1145/2737924.2737955openalex-snapshot
Compositional certified resource bounds
inferredcites →https://doi.org/10.1145/2933575.2935317openalex-snapshot
Reasoning about Recursive Probabilistic Programs
inferredcites →https://doi.org/10.1145/3009837.3009842openalex-snapshot
Towards automatic resource bound analysis for OCaml
inferredcites →https://doi.org/10.1145/3009837.3009858openalex-snapshot
Relational cost analysis
inferredcites →https://doi.org/10.1145/3009837.3009873openalex-snapshot
Stochastic invariants for probabilistic termination
inferredcites →https://doi.org/10.1145/3062341.3062373openalex-snapshot
Compositional recurrence analysis revisited
inferredcites →https://doi.org/10.1145/3064899.3064910openalex-snapshot
Design and Implementation of Probabilistic Programming Language Anglican
inferredcites →https://doi.org/10.1145/3156018openalex-snapshot
Conditioning in Probabilistic Programming
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/3158124openalex-snapshot
Monadic refinements for relational cost analysis
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/3208102openalex-snapshot
Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms
inferredcites →https://doi.org/10.1145/3314221.3314581openalex-snapshot
Cost analysis of nondeterministic probabilistic programs
inferredcites →https://doi.org/10.1145/3314221.3314603openalex-snapshot
Bidirectional type checking for relational properties
inferredcites →https://doi.org/10.1145/3341696openalex-snapshot
Relational cost analysis for functional-imperative programs
inferredcites →https://doi.org/10.1145/3360555openalex-snapshot
Modular verification for almost-sure termination of probabilistic programs
inferredcites →https://doi.org/10.1145/3371093openalex-snapshot
Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time
inferredcites →https://doi.org/10.1145/3385412.3385969openalex-snapshot
Polynomial invariant generation for non-deterministic recursive programs
inferredcites →https://doi.org/10.1145/3385412.3386002openalex-snapshot
Proving almost-sure termination by omega-regular decomposition
inferredcites →https://doi.org/10.1145/3408992openalex-snapshot
Raising expectations: automating expected cost analysis with types
inferredcites →https://doi.org/10.1145/3434320openalex-snapshot
Relatively complete verification of probabilistic programs: an expressive language for expectation-based reasoning
inferredcites →https://doi.org/10.1145/3434333openalex-snapshot
A pre-expectation calculus for probabilistic sensitivity
inferredcites →https://doi.org/10.1145/3450967openalex-snapshot
Ranking and Repulsing Supermartingales for Reachability in Randomized Programs
inferredcites →https://doi.org/10.1145/3453483.3454062openalex-snapshot
Central moment analysis for cost accumulators in probabilistic programs
inferredcites →https://doi.org/10.1145/3453483.3454076openalex-snapshot
Polynomial reachability witnesses via Stellensätze
inferredcites →https://doi.org/10.1145/3453483.3454093openalex-snapshot
Proving non-termination by program reversal
inferredcites →https://doi.org/10.1145/3453483.3454111openalex-snapshot
On probabilistic termination of functional programs with continuous distributions
inferredcites →https://doi.org/10.1145/3519939.3523435openalex-snapshot
Differential cost analysis with simultaneous potentials and anti-potentials
inferredcites →https://doi.org/10.1145/3519939.3523721openalex-snapshot
Guaranteed bounds for posterior inference in universal probabilistic programming
inferredcites →https://doi.org/10.1145/3585391openalex-snapshot
On Lexicographic Proof Rules for Probabilistic Termination
inferredcites →https://doi.org/10.1512/iumj.1993.42.42045openalex-snapshot
inferredcites →https://doi.org/10.1515/crll.1902.124.1openalex-snapshot
Theorie der einfachen Ungleichungen.
inferredcites →https://doi.org/10.2140/pjm.1988.132.35openalex-snapshot
Representing polynomials by positive linear functions on compact convex polyhedra
inferredcites →https://doi.org/10.23638/lmcs-16(4:3)2020openalex-snapshot
Of Cores: A Partial-Exploration Framework for Markov Decision Processes
inferredcites →https://doi.org/10.48550/arxiv.1810.09538openalex-snapshot
Pyro: Deep Universal Probabilistic Programming
inferredcites →https://doi.org/10.5281/zenodo.10457565openalex-snapshot
Artefact for: Quantitative Bounds on Resource Usage of Probabilistic Programs
inferredcites →https://doi.org/10.7717/peerj-cs.103openalex-snapshot
SymPy: symbolic computing in Python

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-71162-6_31openalex-snapshot
Sound and Complete Witnesses for Template-Based Verification of LTL Properties on Polynomial Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-71162-6_6openalex-snapshot
Practical Approximate Quantifier Elimination for Non-linear Real Arithmetic
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-031-91121-7_1openalex-snapshot
Efficient Synthesis of Tight Polynomial Upper-Bounds for Systems of Conditional Polynomial Recurrences
inferred← citeshttps://doi.org/10.1007/978-3-031-98679-6_1openalex-snapshot
Quantitative Supermartingale Certificates
inferred← citeshttps://doi.org/10.1007/978-3-031-98679-6_2openalex-snapshot
Supermartingale Certificates for Quantitative Omega-Regular Verification and Control
inferred← citeshttps://doi.org/10.1007/978-3-032-22723-2_8openalex-snapshot
Error Localization, Certificates, and Hints for Probabilistic Program Verification via Slicing
inferred← citeshttps://doi.org/10.1007/978-3-032-26204-2_29openalex-snapshot
Highly Incremental: A Simple Programmatic Approach for Many Objectives
inferred← citeshttps://doi.org/10.1016/j.ic.2025.105368openalex-snapshot
Finite-time safety and reach-avoid verification of stochastic discrete-time systems
inferred← citeshttps://doi.org/10.1109/icbc59979.2024.10634352openalex-snapshot
Congesting Ethereum after EIP-1559
inferred← citeshttps://doi.org/10.1145/3689753openalex-snapshot
Tachis: Higher-Order Separation Logic with Credits for Expected Costs
inferred← citeshttps://doi.org/10.1145/3704874openalex-snapshot
Guaranteed Bounds on Posterior Distributions of Discrete Probabilistic Programs with Loops
inferred← citeshttps://doi.org/10.1145/3776691openalex-snapshot
Verifying Almost-Sure Termination for Randomized Distributed Algorithms
inferred← citeshttps://doi.org/10.1145/3808296openalex-snapshot
SuperDP: Differential Privacy Refutation via Supermartingales
inferred← citeshttps://doi.org/10.1145/3808348openalex-snapshot
Supermartingales for Unique Fixed Points: A Unified Approach to Lower Bound Verification
inferred← citeshttps://doi.org/10.29007/njphopenalex-snapshot
Automated Synthesis of Decision Lists for Polynomial Specifications over Integers
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.