Home
News
People
Publications
Courses
Vacancies
Contact
Pulp Fictions
Light
Dark
Automatic
lower bounds
Lower Bounds for Possibly Divergent Probabilistic Programs
We present a new proof rule for verifying lower bounds on quantities of probabilistic programs. Our proof rule is not confined to …
Shenghua Feng
,
Mingshuai Chen
,
Han Su
,
Benjamin Lucien Kaminski
,
Joost-Pieter Katoen
,
Naijun Zhan
PDF
Cite
Poster
Slides
DOI
Cite
×