activity
20152026
most citedWeakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs

15 citations · 34 across the 5 of their papers we have counts for

collaborators

6 papers

cs.PL2026

A Gradual Probabilistic Lambda Calculus

Wenjia Ye, Matías Toro, Federico Olmedo

Probabilistic programming languages extend ordinary programming languages with the ability to sample values from probability distributions. Type systems can establish invariants of…

cs.PL2022

Slicing of Probabilistic Programs based on Specifications

Marcelo Navarro, Federico Olmedo

This paper presents the first slicing approach for probabilistic programs based on specifications. We show that when probabilistic programs are accompanied by their specifications…

cs.LO2019

Runtime Analysis of Quantum Programs: A Formal Approach

Federico Olmedo, Alejandro Díaz-Caro

In this abstract we study the resource consumption of quantum programs. Specifically, we focus on the expected runtime of programs and, inspired by recent methods for probabilistic…

cs.LO2016★ 12 cited

Reasoning about Recursive Probabilistic Programs

Federico Olmedo, Benjamin Lucien Kaminski, Joost-Pieter Katoen +1

This paper presents a wp-style calculus for obtaining expectations on the outcomes of (mutually) recursive probabilistic programs. We provide several proof rules to derive one-- an…

cs.LO2016★ 15 cited

Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs

Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja +1

This paper presents a wp-style calculus for obtaining bounds on the expected run-time of probabilistic programs. Its application includes determining the (possibly infinite) expect…

cs.PL2015★ 7 cited

Conditioning in Probabilistic Programming

Friedrich Gretz, Nils Jansen, Benjamin Lucien Kaminski +3

We investigate the semantic intricacies of conditioning, a main feature in probabilistic programming. We provide a weakest (liberal) pre-condition (w(l)p) semantics for the element…