_id,doi,title
9645,10.1145/3453483.3454076,Polynomial reachability witnesses via Stellensätze
9646,10.1145/3453483.3454102,Quantitative analysis of assertion violations in probabilistic programs
8089,10.1145/3385412.3385969,Polynomial invariant generation for non-deterministic recursive programs
6175,10.1145/3314221.3314581,Cost analysis of nondeterministic probabilistic programs
5977,10.24963/ijcai.2018/653,Computational approaches for stochastic shortest path on succinct MDPs
5993,10.1145/3174800,Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
1438,10.1145/2837614.2837639,Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
1386,10.1007/978-3-319-41528-4_1,Termination analysis of probabilistic programs through Positivstellensatz's