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
2023 | Journal Article | IST-REx-ID: 14778 | 
Chatterjee, K., Kafshdar Goharshady, E., Novotný, P., Zárevúcky, J., & Zikelic, D. (2023). On lexicographic proof rules for probabilistic termination. Formal Aspects of Computing. Association for Computing Machinery. https://doi.org/10.1145/3585391
[Published Version]
View
| Files available
| DOI
| arXiv