On lexicographic proof rules for probabilistic termination

• المؤلفون الرئيسيون: 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...