The paper “Reasoning about Recursive Probabilistic Programs” by Federico Olmedo, Benjamin Lucien Kaminski, Joost-Pieter Katoen and Christoph Matheja, as well as the paper “On the Satisfiability of Some Simple Probabilistic Logics” by Souymodip Chakraborty and Joost-Pieter Katoen have been accepted at LICS 2016.

The former paper presents a wp-calculus and accompanying proof rules for recursive probabilistic programs and applies this to analyse the correctness and run-time of randomised binary search.

The second paper presents satisfiability results and finite model properties for two simplified probabilistic logics (bounded PCTL — a simplified variant of PCTL, and PmuTL — a simplified variant of the probabilistic mu calculus).