On Lexicographic Proof Rules for Probabilistic Termination

Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný 0001, Jiri Zárevúcky, Dorde Zikelic. On Lexicographic Proof Rules for Probabilistic Termination. In Marieke Huisman, Corina S. Pasareanu, Naijun Zhan, editors, Formal Methods - 24th International Symposium, FM 2021, Virtual Event, November 20-26, 2021, Proceedings. Volume 13047 of Lecture Notes in Computer Science, pages 619-639, Springer, 2021. [doi]

@inproceedings{ChatterjeeGNZZ21,
  title = {On Lexicographic Proof Rules for Probabilistic Termination},
  author = {Krishnendu Chatterjee and Ehsan Kafshdar Goharshady and Petr Novotný 0001 and Jiri Zárevúcky and Dorde Zikelic},
  year = {2021},
  doi = {10.1007/978-3-030-90870-6_33},
  url = {https://doi.org/10.1007/978-3-030-90870-6_33},
  researchr = {https://researchr.org/publication/ChatterjeeGNZZ21},
  cites = {0},
  citedby = {0},
  pages = {619-639},
  booktitle = {Formal Methods - 24th International Symposium, FM 2021, Virtual Event, November 20-26, 2021, Proceedings},
  editor = {Marieke Huisman and Corina S. Pasareanu and Naijun Zhan},
  volume = {13047},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-90870-6},
}