On the termination problem for probabilistic higher-order recursive programs

DOI10.5555/3470152.3470177MaRDI QIDQ6654489zbMATH OpenFDO

Authors Naoki Kobayashi, Ugo Dal Lago, Charles Grellois

Publication date 19 December 2024

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• On the termination problem for probabilistic higher-order recursive programs
• A probabilistic higher-order fixpoint logic
• Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
• Automata, Probability, and Recursion
• On the hardness of almost-sure termination

This page was built for publication: On the termination problem for probabilistic higher-order recursive programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6654489)