We present Ellora, a sound and relatively complete assertion-based program logic, and demonstrate its expressivity by verifying several classical examples of randomized algorithms using an implementation in the EasyCrypt proof assistant. Ellora features new proof rules for loops and adversarial code, and supports richer assertions than existing program logics. We also show that Ellora allows convenient reasoning about complex probabilistic concepts by developing a new program logic for probabilistic independence and distribution law, and then smoothly embedding it into Ellora.
CITATION STYLE
Barthe, G., Espitau, T., Gaboardi, M., Grégoire, B., Hsu, J., & Strub, P. Y. (2018). An assertion-based program logic for probabilistic programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10801 LNCS, pp. 117–144). Springer Verlag. https://doi.org/10.1007/978-3-319-89884-1_5
Mendeley helps you to discover research relevant for your work.