Paper accepted at POPL 2018

The paper entitled “A new proof rule for almost-sure termination” by Annabelle McIver, Carroll Morgan, Benjamin Kaminski, and Joost-Pieter Katoen has been accepted for POPL 2018. The paper presents a proof rule to verify whether a probabilistic program (possibly including non-determinacy) almost surely terminates. The new proof rule enables to capture a larger class of programs than could be captured so far with existing techniques.