Error Credits: Resourceful Reasoning about Error Bounds for Higher-Order Probabilistic Programs
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916498994364416 |
|---|---|
| author | Aguirre, Alejandro Haselwarter, Philipp G. de Medeiros, Markus Li, Kwing Hei Gregersen, Simon Oddershede Tassarotti, Joseph Birkedal, Lars |
| author_facet | Aguirre, Alejandro Haselwarter, Philipp G. de Medeiros, Markus Li, Kwing Hei Gregersen, Simon Oddershede Tassarotti, Joseph Birkedal, Lars |
| contents | Probabilistic programs often trade accuracy for efficiency, and thus may, with a small probability, return an incorrect result. It is important to obtain precise bounds for the probability of these errors, but existing verification approaches have limitations that lead to error probability bounds that are excessively coarse, or only apply to first-order programs. In this paper we present Eris, a higher-order separation logic for proving error probability bounds for probabilistic programs written in an expressive higher-order language. Our key novelty is the introduction of error credits, a separation logic resource that tracks an upper bound on the probability that a program returns an erroneous result. By representing error bounds as a resource, we recover the benefits of separation logic, including compositionality, modularity, and dependency between errors and program terms, allowing for more precise specifications. Moreover, we enable novel reasoning principles such as expectation-preserving error composition, amortized error reasoning, and error induction. We illustrate the advantages of our approach by proving amortized error bounds on a range of examples, including collision probabilities in hash functions, which allow us to write more modular specifications for data structures that use them as clients. We also use our logic to prove correctness and almost-sure termination of rejection sampling algorithms. All of our results have been mechanized in the Coq proof assistant using the Iris separation logic framework and the Coquelicot real analysis library. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_14223 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Error Credits: Resourceful Reasoning about Error Bounds for Higher-Order Probabilistic Programs Aguirre, Alejandro Haselwarter, Philipp G. de Medeiros, Markus Li, Kwing Hei Gregersen, Simon Oddershede Tassarotti, Joseph Birkedal, Lars Logic in Computer Science Programming Languages Probabilistic programs often trade accuracy for efficiency, and thus may, with a small probability, return an incorrect result. It is important to obtain precise bounds for the probability of these errors, but existing verification approaches have limitations that lead to error probability bounds that are excessively coarse, or only apply to first-order programs. In this paper we present Eris, a higher-order separation logic for proving error probability bounds for probabilistic programs written in an expressive higher-order language. Our key novelty is the introduction of error credits, a separation logic resource that tracks an upper bound on the probability that a program returns an erroneous result. By representing error bounds as a resource, we recover the benefits of separation logic, including compositionality, modularity, and dependency between errors and program terms, allowing for more precise specifications. Moreover, we enable novel reasoning principles such as expectation-preserving error composition, amortized error reasoning, and error induction. We illustrate the advantages of our approach by proving amortized error bounds on a range of examples, including collision probabilities in hash functions, which allow us to write more modular specifications for data structures that use them as clients. We also use our logic to prove correctness and almost-sure termination of rejection sampling algorithms. All of our results have been mechanized in the Coq proof assistant using the Iris separation logic framework and the Coquelicot real analysis library. |
| title | Error Credits: Resourceful Reasoning about Error Bounds for Higher-Order Probabilistic Programs |
| topic | Logic in Computer Science Programming Languages |
| url | https://arxiv.org/abs/2404.14223 |