On lexicographic proof rules for probabilistic termination

• Main Authors: CHATTERJEE, Krishnendu, GOHARSHADY, Ehsan Kafshdar, NOVOTNÝ, Petr, ZÁREVUCKÝ, Jiří, ZIKELIC, Dorde
• 格式: text
• 語言: English
• 出版: Institutional Knowledge at Singapore Management University 2025
• 主題: Probabilistic programs; termination; martingales; Software Engineering
• 在線閱讀: https://ink.library.smu.edu.sg/sis_research/9069; https://ink.library.smu.edu.sg/context/sis_research/article/10072/viewcontent/3585391.pdf
• 機構: Singapore Management University

We consider the almost-sure (a.s.) termination problem for probabilistic programs, which are a stochastic extension of classical imperative programs. Lexicographic ranking functions provide a sound and practical approach for termination of non-probabilistic programs, and their extension to probabili...