Pith. sign in

REVIEW 1 cited by

Modular Runtime Complexity Analysis of Probabilistic While 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 1908.11343 v1 pith:FZZINUNQ submitted 2019-08-23 cs.PL cs.LO

Modular Runtime Complexity Analysis of Probabilistic While Programs

Martin Avanzini , Michael Schaper , Georg Moser This is my paper
classification cs.PL cs.LO
keywords analysismodularprobabilisticprogramsruntimecomplexityapproachesaverage
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

We are concerned with the average case runtime complexity analysis of a prototypical imperative language endowed with primitives for sampling and probabilistic choice. Taking inspiration from known approaches from to the modular resource analysis of non-probabilistic programs, we investigate how a modular runtime analysis is obtained for probabilistic programs.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams

    cs.PL 2026-06 unverdicted novelty 6.0

    Typed extended decision diagrams enable scalable deductive verification of probabilistic programs by compactly representing weakest pre-expectations.