On the public citation graph

Aiming low is harder: induction for lower bounds in probabilistic program verification

https://doi.org/10.1145/3371105
0 signed · 102 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/zamm.19300100113openalex-snapshot
Eine Wahrscheinlichkeitsaufgabe in der Kundenwerbung
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-10936-7_6openalex-snapshot
Expectation Invariants for Probabilistic Program Loops as Fixed Points
inferredcites →https://doi.org/10.1007/978-3-319-21690-4_44openalex-snapshot
Counterexample-Guided Polynomial Loop Invariant Generation by Lagrange Interpolation
inferredcites →https://doi.org/10.1007/978-3-319-40229-1_37openalex-snapshot
Lower Runtime Bounds for Integer Programs
inferredcites →https://doi.org/10.1007/978-3-319-46520-3_5openalex-snapshot
Bounded Model Checking for Probabilistic Programs
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-15769-1_24openalex-snapshot
Linear-Invariant Generation for Probabilistic Programs:
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-49498-1_15openalex-snapshot
Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs
inferredcites →https://doi.org/10.1007/b138392openalex-snapshot
Abstraction, Refinement and Proof for Probabilistic Systems
inferredcites →https://doi.org/10.1007/s00165-010-0157-0openalex-snapshot
A probability perspective
inferredcites →https://doi.org/10.1007/s00236-018-0321-1openalex-snapshot
On the hardness of analyzing probabilistic programs
inferredcites →https://doi.org/10.1016/0012-365x(91)90413-vopenalex-snapshot
The contraction principle as a particular case of Kleene's fixed point theorem
inferredcites →https://doi.org/10.1016/0016-0032(58)90688-4openalex-snapshot
An introduction to probability theory and its applications
inferredcites →https://doi.org/10.1016/0020-0190(82)90065-5openalex-snapshot
Fixed point theorems and semantics: a folk tale
inferredcites →https://doi.org/10.1016/0022-0000(85)90012-1openalex-snapshot
A probabilistic PDL
inferredcites →https://doi.org/10.1016/b978-0-12-172651-5.x5000-3openalex-snapshot
Probability and Random Processes
inferredcites →https://doi.org/10.1016/j.entcs.2015.12.016openalex-snapshot
Healthiness Conditions for Predicate Transformers
inferredcites →https://doi.org/10.1016/j.scico.2005.02.008openalex-snapshot
Abstract interpretation of programs as Markov decision processes
inferredcites →https://doi.org/10.1016/j.scico.2007.09.002openalex-snapshot
Proofs of randomized algorithms in Coq
inferredcites →https://doi.org/10.1016/s0304-3975(00)00208-5openalex-snapshot
Partial correctness for probabilistic demonic programs
inferredcites →https://doi.org/10.1017/9781009302180.034openalex-snapshot
Randomized Algorithms
inferredcites →https://doi.org/10.1017/cbo9780511814075openalex-snapshot
Randomized Algorithms
inferredcites →https://doi.org/10.1017/s0004972700022243openalex-snapshot
The Tarski–Kantorovitch prinicple and the theory of iterated function systems
inferredcites →https://doi.org/10.1093/jigpal/7.6.779openalex-snapshot
An expectation-transformer model for probabilistic temporal logic
inferredcites →https://doi.org/10.1093/oso/9780198572237.001.0001openalex-snapshot
Probability and Random Processes
inferredcites →https://doi.org/10.1109/lics.2017.8005153openalex-snapshot
A weakest pre-expectation semantics for mixed-sign expectations
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/sfcs.1985.12openalex-snapshot
Automatic verification of probabilistic concurrent finite state programs
inferredcites →https://doi.org/10.1145/229542.229547openalex-snapshot
Probabilistic predicate transformers
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/2837614.2837639openalex-snapshot
Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
inferredcites →https://doi.org/10.1145/2914770.2837639openalex-snapshot
Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
inferredcites →https://doi.org/10.1145/2933575.2935317openalex-snapshot
Reasoning about Recursive Probabilistic Programs
inferredcites →https://doi.org/10.1145/2933575.2935319openalex-snapshot
Healthiness from Duality
inferredcites →https://doi.org/10.1145/3009837.3009873openalex-snapshot
Stochastic invariants for probabilistic termination
inferredcites →https://doi.org/10.1145/3093333.3009873openalex-snapshot
Stochastic invariants for probabilistic termination
inferredcites →https://doi.org/10.1145/3156018openalex-snapshot
Conditioning in Probabilistic Programming
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/3208102openalex-snapshot
Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms
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/3314221.3314581openalex-snapshot
Cost analysis of nondeterministic probabilistic programs
inferredcites →https://doi.org/10.1145/3371105openalex-snapshot
Aiming low is harder: induction for lower bounds in probabilistic program verification
inferredcites →https://doi.org/10.1145/360933.360975openalex-snapshot
Guarded commands, nondeterminacy and formal derivation of programs
inferredcites →https://doi.org/10.1145/800061.808758openalex-snapshot
A probabilistic PDL
inferredcites →https://doi.org/10.14236/ewic/rw1996.10openalex-snapshot
Proof rules for probabilistic loops
inferredcites →https://doi.org/10.18154/rwth-conv-236462openalex-snapshot
How long, O Bayesian network, will I sample thee? : A program analysis perspective on expected sampling times
inferredcites →https://doi.org/10.2140/pjm.1955.5.285openalex-snapshot
A lattice-theoretical fixpoint theorem and its applications
inferredcites →https://doi.org/10.2307/2288240openalex-snapshot
Probability Theory and Elements of Measure Theory.
inferredcites →https://doi.org/10.2307/2344620openalex-snapshot
An Introduction to Probability Theory and its Applications.
inferredcites →https://doi.org/10.48550/arxiv.1709.04037openalex-snapshot
Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs
inferredcites →https://doi.org/10.48550/arxiv.1711.03588openalex-snapshot
A New Proof Rule for Almost-Sure Termination
inferredcites →https://doi.org/10.5555/3329995.3330088openalex-snapshot
A weakest pre-expectation semantics for mixed-sign expectations

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-53291-8_27openalex-snapshot
PrIC3: Property Directed Reachability for MDPs
inferred← citeshttps://doi.org/10.1007/978-3-030-68446-4_12openalex-snapshot
Generating Functions for Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-72016-2_14openalex-snapshot
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
inferred← citeshttps://doi.org/10.1007/978-3-030-72019-3_18openalex-snapshot
Automated Termination Analysis of Polynomial Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-81688-9_40openalex-snapshot
Lower-Bound Synthesis Using Loop Specialization and Max-SMT
inferred← citeshttps://doi.org/10.1007/978-3-030-90870-6_33openalex-snapshot
On Lexicographic Proof Rules for Probabilistic Termination
inferred← citeshttps://doi.org/10.1007/978-3-031-13185-1_3openalex-snapshot
Data-Driven Invariant Learning for Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-13185-1_4openalex-snapshot
Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-13185-1_5openalex-snapshot
Does a Program Yield the Right Distribution?
inferred← citeshttps://doi.org/10.1007/978-3-031-17715-6_24openalex-snapshot
A Specification Logic for Programs in the Probabilistic Guarded Command Language
inferred← citeshttps://doi.org/10.1007/978-3-031-30820-8_25openalex-snapshot
Probabilistic Program Verification via Inductive Synthesis of Inductive Invariants
inferred← citeshttps://doi.org/10.1007/978-3-031-75434-0_17openalex-snapshot
A Game-Based Semantics for the Probabilistic Intermediate Verification Language HeyVL
inferred← citeshttps://doi.org/10.1007/978-3-031-75783-9_10openalex-snapshot
A Unified Framework for Quantitative Analysis of Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-75783-9_11openalex-snapshot
J-P: MDP. FP. PP
inferred← citeshttps://doi.org/10.1007/978-3-031-75783-9_8openalex-snapshot
Polar: An Algebraic Analyzer for (Probabilistic) Loops
inferred← citeshttps://doi.org/10.1007/978-3-031-98679-6_1openalex-snapshot
Quantitative Supermartingale Certificates
inferred← citeshttps://doi.org/10.1007/978-3-032-05792-1_15openalex-snapshot
Positive Almost-Sure Termination of Polynomial Random Walks
inferred← citeshttps://doi.org/10.1007/978-3-032-16855-9_5openalex-snapshot
Fixed-Point Reasoning for Stochastic Systems
inferred← citeshttps://doi.org/10.1007/978-3-032-22720-1_12openalex-snapshot
Generating Functions Meet Occupation Measures: Invariant Synthesis for Probabilistic Loops
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.1007/978-3-032-32537-2_27openalex-snapshot
Caesar: A Deductive Verifier for Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/s10515-022-00327-zopenalex-snapshot
A three-valued model abstraction framework for PCTL* stochastic model checking
inferred← citeshttps://doi.org/10.1007/s10703-024-00466-xopenalex-snapshot
Data-driven invariant learning for probabilistic programs
inferred← citeshttps://doi.org/10.1145/3408992openalex-snapshot
Raising expectations: automating expected cost analysis with types
inferred← citeshttps://doi.org/10.1145/3434333openalex-snapshot
A pre-expectation calculus for probabilistic sensitivity
inferred← citeshttps://doi.org/10.1145/3453483.3454062openalex-snapshot
Central moment analysis for cost accumulators in probabilistic programs
inferred← citeshttps://doi.org/10.1145/3453483.3454102openalex-snapshot
Quantitative analysis of assertion violations in probabilistic programs
inferred← citeshttps://doi.org/10.1145/3585391openalex-snapshot
On Lexicographic Proof Rules for Probabilistic Termination
inferred← citeshttps://doi.org/10.1145/3589962openalex-snapshot
Mechanized Proofs of Adversarial Complexity and Application to Universal Composability
inferred← citeshttps://doi.org/10.1145/3622870openalex-snapshot
A Deductive Verification Infrastructure for Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3632935openalex-snapshot
Programmatic Strategy Synthesis: Resolving Nondeterminism in Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3649844openalex-snapshot
Exact Bayesian Inference for Loopy Probabilistic Programs using Generating Functions
inferred← citeshttps://doi.org/10.1145/3656462openalex-snapshot
Equivalence and Similarity Refutation for Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3674662openalex-snapshot
Automated Verification of Higher-Order Probabilistic Programs via a Dependent Refinement Type System
inferred← citeshttps://doi.org/10.1145/3689740openalex-snapshot
Quantitative Weakest Hyper Pre: Unifying Correctness and Incorrectness Hyperproperties via Predicate Transformers
inferred← citeshttps://doi.org/10.1145/3689753openalex-snapshot
Tachis: Higher-Order Separation Logic with Credits for Expected Costs
inferred← citeshttps://doi.org/10.1145/3704876openalex-snapshot
A Quantitative Probabilistic Relational Hoare Logic
inferred← citeshttps://doi.org/10.1145/3720429openalex-snapshot
Foundations for Deductive Verification of Continuous Probabilistic Programs: From Lebesgue to Riemann and Back
inferred← citeshttps://doi.org/10.1145/3729317openalex-snapshot
Probabilistic Refinement Session Types
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.26226/morressier.604907f41a80aac83ca25cf4openalex-snapshot
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25d19openalex-snapshot
Automated Termination Analysis of Polynomial Probabilistic Programs
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.2103.16105openalex-snapshot
Expected-Cost Analysis for Probabilistic Programs and Semantics-Level Adaption of Optional Stopping Theorems
showing the first 44 of 45 · page through all 45
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.