Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
1 Publication
2021 | Conference Paper | IST-REx-ID: 10414 | 
Chatterjee, K., Goharshady, E. K., Novotný, P., Zárevúcky, J., & Zikelic, D. (2021). On lexicographic proof rules for probabilistic termination. In 24th International Symposium on Formal Methods (Vol. 13047, pp. 619–639). Virtual: Springer Nature. https://doi.org/10.1007/978-3-030-90870-6_33
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv