The paper entitled “Foundations for Deductive Verification of Continuous Probabilistic Programs: From Lebesgue to Riemann and Back” by Kevin Batz, Joost-Pieter Katoen, Francesca Randone (University of Trieste), and Tobias Winkler has been accepted for the International Conference on Object-Oriented Programming Systems, Languages, and Application (OOPSLA 2025). The paper presents a new technique to formally check bounds on the expected outcomes of probabilistic programs with continuous uniform sampling, conditioning, and while loops.