Learning probabilistic termination proofs
We present the first machine learning approach to the termination analysis of probabilistic programs. Ranking supermartingales (RSMs) prove that probabilistic programs halt, in expectation, within a finite number of steps. While previously RSMs were directly synthesised from source code, our method...
| Main Authors: | , , |
|---|---|
| 格式: | Conference item |
| 语言: | English |
| 出版: |
Springer Nature
2021
|