On the Termination Problem for Probabilistic Higher-Order Recursive Programs

11/06/2018
by   Naoki Kobayashi, et al.
0

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 higher-order probabilistic programming languages, not much has been done to combine those two approaches. In this paper, we initiate a study on the probabilistic higher-order model checking problem, by giving some first theoretical and experimental results. As a first step towards our goal, we introduce PHORS, a probabilistic extension of higher-order recursion schemes (HORS), as a model of probabilistic higher-order programs. The model of PHORS may alternatively be viewed as a higher-order extension of recursive Markov chains. We then investigate the probabilistic termination problem --- or, equivalently, the probabilistic reachability problem. We prove that almost sure termination of order-2 PHORS is undecidable. We also provide a fixpoint characterization of the termination probability of PHORS, and develop a sound (but possibly incomplete) procedure for approximately computing the termination probability. We have implemented the procedure for order-2 PHORSs, and confirmed that the procedure works well through preliminary experiments that are reported at the end of the article.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/29/2020

A Probabilistic Higher-order Fixpoint Logic

We introduce PHFL, a probabilistic extension of higher-order fixpoint lo...
research
07/25/2023

Higher-Order LCTRSs and Their Termination

Logically constrained term rewriting systems (LCTRSs) are a program anal...
research
08/31/2023

On Model-Checking Higher-Order Effectful Programs (Long Version)

Model-checking is one of the most powerful techniques for verifying syst...
research
02/23/2023

Certifying Higher-Order Polynomial Interpretations

Higher-order rewriting is a framework in which one can write higher-orde...
research
01/21/2021

General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond

The model of asynchronous programming arises in many contexts, from low-...
research
12/07/2019

Modular Termination Checking Theorems for Second-Order Computation

We present new theorems of modular termination checking for second-order...
research
12/29/2021

Learning Higher-Order Programs without Meta-Interpretive Learning

Learning complex programs through inductive logic programming (ILP) rema...

Please sign up or login with your details

Forgot password? Click here to reset