On ranking function synthesis and termination for polynomial programs
We consider the problem of synthesising polynomial ranking functions for single-path loops over the reals with continuous semi-algebraic update function and compact semi-algebraic guard set. We show that a loop of this form has a polynomial ranking function if and only if it terminates. We further s...
| Główni autorzy: | , , |
|---|---|
| Format: | Conference item |
| Język: | English |
| Wydane: |
Leibniz International Proceedings in Informatics
2020
|