On lexicographic proof rules for probabilistic termination
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...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Institutional Knowledge at Singapore Management University
2025
|
| Subjects: | |
| Online Access: | https://ink.library.smu.edu.sg/sis_research/9069 https://ink.library.smu.edu.sg/context/sis_research/article/10072/viewcontent/3585391.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Singapore Management University |
| Language: | English |