Zobrazeno 1 - 10
of 43
pro vyhledávání: '"Olmedo, Federico"'
Publikováno v:
Communications of the ACM. Aug2024, Vol. 67 Issue 8, p49-53. 5p.
Autor:
Navarro, Marcelo, Olmedo, Federico
This paper presents the first slicing approach for probabilistic programs based on specifications. We show that when probabilistic programs are accompanied by their specifications in the form of pre- and post-condition, we can exploit this semantic i
Externí odkaz:
http://arxiv.org/abs/2205.03707
Autor:
Toro, Matías, Darais, David, Abuah, Chike, Near, Joe, Árquez, Damián, Olmedo, Federico, Tanter, Éric
Language support for differentially-private programming is both crucial and delicate. While elaborate program logics can be very expressive, type-system based approaches using linear types tend to be more lightweight and amenable to automatic checkin
Externí odkaz:
http://arxiv.org/abs/2010.11342
Autor:
Olmedo, Federico, Díaz-Caro, Alejandro
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 programs, we develop a calculus \`a la weakest precondition to formal
Externí odkaz:
http://arxiv.org/abs/1911.11247
Autor:
Encina-Rojas, Arnulfo, Ríos-Velázquez, Danny, Sevilla-Linares, Víctor, Villarreal, Samuel, Moriya, Miguel Angel Ken, Olivera, Carolina, Vargas, Ronald, Olmedo, Federico, Barreras, Aylin, Guevara, Mario
Publikováno v:
In Geoderma Regional March 2023 32
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-- and two--sided bounds for such expectations, and show the soundness of o
Externí odkaz:
http://arxiv.org/abs/1603.02922
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) expected termination time of a probabilistic program and proving positive al
Externí odkaz:
http://arxiv.org/abs/1601.01001
Autor:
Gretz, Friedrich, Jansen, Nils, Kaminski, Benjamin Lucien, Katoen, Joost-Pieter, McIver, Annabelle, Olmedo, Federico
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 elementary probabilistic programming language pGCL extended with conditioning
Externí odkaz:
http://arxiv.org/abs/1504.00198
Publikováno v:
Semantic Web (1570-0844); 2024, Vol. 15 Issue 3, p745-773, 29p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.