Computing Expected Runtimes for Constant Probability Programs

@article{Giesl2019ComputingER,
  title={Computing Expected Runtimes for Constant Probability Programs},
  author={Jurgen Giesl and Peter Giesl and Marcel Hark},
  journal={ArXiv},
  year={2019},
  volume={abs/1905.09544}
}
  • Jurgen Giesl, Peter Giesl, Marcel Hark
  • Published 2019
  • Computer Science, Mathematics
  • ArXiv
  • We introduce the class of constant probability (CP) programs and show that classical results from probability theory directly yield a simple decision procedure for (positive) almost sure termination of programs in this class. Moreover, asymptotically tight bounds on their expected runtime can always be computed easily. Based on this, we present an algorithm to infer the exact expected runtime of any CP program. 

    Topics from this paper.

    Citations

    Publications citing this paper.

    Inferring Lower Runtime Bounds for Integer Programs

    VIEW 1 EXCERPT
    CITES BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 39 REFERENCES

    Analyzing Runtime and Size Complexity of Integer Programs

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Quantitative analysis of probabilistic pushdown automata: expectations and variances