Pith. sign in

REVIEW

Lower Bounds for Possibly Divergent Probabilistic Programs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2302.06082 v1 pith:IGNEKWS5 submitted 2023-02-13 cs.LO math.PR

Shenghua Feng , Mingshuai Chen , Han Su , Benjamin Lucien Kaminski , Joost-Pieter Katoen , Naijun Zhan This is my paper · ORCID
classification cs.LOmath.PR
keywords boundslowerprobabilisticprogramsdivergentpossiblyproofrule
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We present a new proof rule for verifying lower bounds on quantities of probabilistic programs. Our proof rule is not confined to almost-surely terminating programs -- as is the case for existing rules -- and can be used to establish non-trivial lower bounds on, e.g., termination probabilities and expected values, for possibly divergent probabilistic loops, e.g., the well-known three-dimensional random walk on a lattice.

Discussion (0). Continue with ORCID to comment.

Pith tools