DOI,IST REx ID,Research Group,Title of publication
10.1145/3453483.3454076,9645,KrCh,Polynomial reachability witnesses via Stellensätze
10.1145/3453483.3454102,9646,KrCh,Quantitative analysis of assertion violations in probabilistic programs
10.1017/9781108770750.008,19986,KrCh,Termination Analysis of Probabilistic Programs with Martingales
10.1145/3385412.3385969,8089,KrCh,Polynomial invariant generation for non-deterministic recursive programs
10.1145/3314221.3314581,6175,KrCh,Cost analysis of nondeterministic probabilistic programs
10.1145/3174800,5993,KrCh,Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
10.24963/ijcai.2018/653,5977,KrCh,Computational approaches for stochastic shortest path on succinct MDPs
10.1145/2837614.2837639,1438,KrCh,Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
10.1007/978-3-319-41528-4_1,1386,KrCh,Termination analysis of probabilistic programs through Positivstellensatz's