On the Termination Problem for Probabilistic Higher-Order Recursive Programs

  title={On the Termination Problem for Probabilistic Higher-Order Recursive Programs},
  author={N. Kobayashi and Ugo Dal Lago and Charles Grellois},
  journal={2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
In the last two decades, there has been much progress on model checking of both probabilistic systems and higher-order programs. In spite of the emergence of higherorder probabilistic programming languages, not much has been done to combine those two approaches. As a first step towards model checking of probabilistic higher-order programs, we introduce PHORS, a probabilistic extension of higher-order recursion schemes (HORS), as a model of probabilistic higherorder programs. The model of PHORS… Expand
7 Citations
A Probabilistic Higher-Order Fixpoint Logic
  • PDF
Aiming low is harder: induction for lower bounds in probabilistic program verification
  • 9
  • PDF
On Probabilistic Termination of Functional Programs with Continuous Distributions
  • Highly Influenced
  • PDF
Intersection types and (positive) almost-sure termination
  • 2
  • PDF


On the Termination Problem for Probabilistic Higher-Order Recursive Programs
  • 1
Types and higher-order recursion schemes for verification of higher-order programs
  • 156
  • PDF
Model Checking of Recursive Probabilistic Systems
  • 24
  • PDF
Model-checking higher-order functions
  • 79
  • PDF
Model Checking Higher-Order Programs
  • 84
Saturation-Based Model Checking of Higher-Order Recursion Schemes
  • 54
  • PDF
Checking LTL properties of recursive Markov chains
  • M. Yannakakis, K. Etessami
  • Mathematics, Computer Science
  • Second International Conference on the Quantitative Evaluation of Systems (QEST'05)
  • 2005
  • 35
  • PDF
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
  • 31
  • PDF
On Probabilistic Program Equivalence and Refinement
  • 29
  • PDF