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