S. Agrawal, K. Chatterjee, and P. Novotný, Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs, POPL, vol.2, p.32, 2018.

C. Baier and J. Katoen, Principles of Model Checking, 2008.

M. Berkelaar, K. Eikland, and P. Notebaert, lpsolve: Open source (mixed-integer) linear programming system, Eindhoven U. of Technology, 2004.

O. Bournez and F. Garnier, Proving Positive Almost-Sure Termination, RTA, pp.323-337, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00000522

A. Chakarov and S. Sankaranarayanan, Probabilistic Program Analysis with Martingales, CAV, pp.511-526, 2013.

K. Chatterjee and H. Fu, Termination of Nondeterministic Recursive Probabilistic Programs, VMCAI, 2019.

K. Chatterjee, H. Fu, and A. Goharshady, Termination Analysis of Probabilistic Programs Through Positivstellensatz's, CAV, pp.3-22, 2016.

K. Chatterjee, H. Fu, N. Amir-kafshdar-goharshady, and . Okati, Computational Approaches for Stochastic Shortest Path on Succinct MDPs, IJCAI 2018, pp.4700-4707, 2018.

K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs, pp.327-342, 2016.

K. Chatterjee, P. Novotný, and Ð. ?ikeli?, Stochastic invariants for probabilistic termination, POPL, pp.145-160, 2017.

G. Claret, K. Sriram, A. V. Rajamani, A. D. Nori, J. Gordon et al., Bayesian inference using data flow analysis, Joint Meeting on Foundations of Software Engineering, pp.92-102, 2013.

M. Colón, S. Sankaranarayanan, and H. Sipma, Linear Invariant Generation Using Non-linear Constraint Solving, CAV, pp.420-432, 2003.

J. Esparza, A. Gaiser, and S. Kiefer, Proving Termination of Probabilistic Programs Using Patterns, CAV, pp.123-138, 2012.

K. Etessami and M. Yannakakis, Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations, Journal of the ACM (JACM), vol.56, p.1, 2009.

, Mathematikaiés Természettudományi Értesitö, vol.12, pp.457-472, 1894.

F. Luis-maría, H. Fioriti, and . Hermanns, Probabilistic Termination: Soundness, Completeness, and Compositionality, POPL, pp.489-501, 2015.

R. W. Floyd, Assigning meanings to programs, Mathematical Aspects of Computer Science, vol.19, pp.19-33, 1967.

N. Foster, D. Kozen, K. Mamouras, M. Reitblatt, and A. Silva, Probabilistic NetKAT, ESOP, pp.282-309, 2016.

. Noah-d-goodman, K. Vikash, D. Mansinghka, K. Roy, J. B. Bonawitz et al., Church: a language for generative models, UAI, pp.220-229, 2008.

D. Noah, A. Goodman, and . Stuhlmüller, The Design and Implementation of Probabilistic Programming Languages, 2014.

M. Andrew-d-gordon, J. Aizatulin, G. Borgstrom, T. Claret, A. V. Graepel et al., A model-learner pattern for Bayesian reasoning, In ACM SIGPLAN Notices, vol.48, pp.403-416, 2013.

. Andrew-d-gordon, A. Thomas, A. V. Henzinger, . Nori, K. Sriram et al., Probabilistic programming, Proceedings of the on Future of Software Engineering, pp.167-181, 2014.

H. Wim and . Hesselink, Proof Rules for Recursive Procedures, Formal Asp. Comput, vol.5, pp.554-570, 1993.

W. Hoeffding, Probability Inequalities for Sums of Bounded Random Variables, J. Amer. Statist. Assoc, vol.58, pp.13-30, 1963.

M. Huang, H. Fu, and K. Chatterjee, New Approaches for Almost-Sure Termination of Probabilistic Programs, APLAS, pp.181-201, 2018.

M. Huang, H. Fu, K. Chatterjee, and A. Goharshady, Modular Verification for Almost-Sure Termination of Probabilistic Programs, OOPSLA, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01985444

C. Jones, Probabilistic Non-Determinism. Ph.D. Dissertation. The University of Edinburgh, 1989.

D. M. Kahn, Undecidable Problems for Probabilistic Network Programming, MFCS, vol.68, p.17, 2017.

J. Benjamin-lucien-kaminski, C. Katoen, F. Matheja, and . Olmedo, Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs, pp.364-389, 2016.

J. Benjamin-lucien-kaminski, C. Katoen, and . Matheja, On the hardness of analyzing probabilistic programs, Acta Informatica, pp.1-31, 2018.

S. Katz and Z. Manna, A Closer Look at Termination, Acta Inf, vol.5, pp.333-352, 1975.

O. Kupferman, Y. Moshe, and . Vardi, Revised Lectures (Lecture Notes in Computer Science, Compositionality: The Significant Difference, International Symposium, COMPOS'97, vol.1536, pp.381-401, 1997.

M. Lukasiewycz, Pólya urn models, JavaILP -Java Interface to ILP Solvers, 2008.

D. Christopher, . Manning, D. Christopher, H. Manning, and . Schütze, Foundations of statistical natural language processing, 1999.

C. Mcdiarmid, Concentration, Probabilistic Methods for Algorithmic Discrete Mathematics, pp.195-248, 1998.

A. Mciver and C. Morgan, Developing and Reasoning About Probabilistic Programs in pGCL, PSSE, pp.123-155, 2004.

A. Mciver and C. Morgan, Abstraction, Refinement and Proof for Probabilistic Systems, 2005.

A. Mciver, C. Morgan, B. L. Kaminski, and J. Katoen, A new proof rule for almost-sure termination, PACMPL, vol.2, pp.1-33, 2018.

Q. Van-chan-ngo and . Carbonneaux, Bounded expectations: resource analysis for probabilistic programs, PLDI, pp.496-512, 2018.

F. Olmedo, B. L. Kaminski, J. Katoen, and C. Matheja, Reasoning about Recursive Probabilistic Programs, LICS, pp.672-681, 2016.

. Dm-roy, . Vk-mansinghka, J. B. Nd-goodman, and . Tenenbaum, A stochastic programming perspective on nonparametric Bayes, Nonparametric Bayesian Workshop, Int. Conf. on Machine Learning, vol.22, p.26, 2008.

S. Sankaranarayanan, B. Henny, Z. Sipma, and . Manna, Constraint-based linear-relations analysis, SAS, pp.53-68, 2004.

A. Schrijver, Combinatorial Optimization -Polyhedra and Efficiency, 2003.

A. ?cibior, Z. Ghahramani, and A. Gordon, Practical probabilistic programming with monads, In ACM SIGPLAN Notices, vol.50, pp.165-176, 2015.

S. Smolka, P. Kumar, N. Foster, D. Kozen, and A. Silva, Cantor meets Scott: semantic foundations for probabilistic networks, pp.557-571, 2017.

. Sebastian-thrun, Probabilistic algorithms in robotics, Ai Magazine, vol.21, pp.52-57, 2000.

D. Tolpin, J. Van-de-meent, H. Yang, and F. Wood, Design and Implementation of Probabilistic Programming Language Anglican, IFL. ACM, vol.6, pp.1-6, 2016.

D. Wang, J. Hoffmann, and T. W. Reps, PMAF: an algebraic framework for static analysis of probabilistic programs, PLDI, pp.513-528, 2018.

D. Williams, Probability with Martingales, 1991.