Sign Up to like & get
recommendations!
1
Published in 2018 at "Acta Informatica"
DOI: 10.1007/s00236-018-0321-1
Abstract: We study the hardness of deciding probabilistic termination as well as the hardness of approximating expected values (e.g. of program variables) and (co)variances for probabilistic programs.Termination We distinguish two notions of probabilistic termination: Given a…
read more here.
Keywords:
sure termination;
probabilistic programs;
program;
value ... See more keywords