Home
News
People
Publications
Seminar
Courses
Vacancies
Contact
Pulp Fictions
Light
Dark
Automatic
termination
On the Almost-Sure Termination of Probabilistic Counter Programs
This paper introduces $k$-d PCPs – the class of
probabilistic counter programs
with $k \in \mathbb{N}$ counter variables inducing …
Sergei Novozhilov
,
Mingqi Yang
,
Mingshuai Chen
,
Zhiyang Li
,
Jianwei Yin
Cite
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
On Termination of Polynomial Programs with Equality Conditions
We investigate the termination problem of a family of multi-path polynomial programs (MPPs), in which all assignments to program …
Yangjia Li
,
Naijun Zhan
,
Mingshuai Chen
,
Hui Lu
,
Guohua Wu
,
Joost-Pieter Katoen
PDF
Cite
Code
DOI
Cite
×