Verified Density Compilation for a Probabilistic Programming Language-Reference-Cited by-同舟云学术

Verified Density Compilation for a Probabilistic Programming Language

Published:2023-06-06 Issue:PLDI Volume:7 Page:615-637
ISSN:2475-1421
Container-title:Proceedings of the ACM on Programming Languages
language:en
Short-container-title:Proc. ACM Program. Lang.

Author:

Tassarotti Joseph¹^ORCID,Tristan Jean-Baptiste²^ORCID

Affiliation:

1. New York University, USA

2. Amazon Web Services, USA

Abstract

This paper presents ProbCompCert, a compiler for a subset of the Stan probabilistic programming language (PPL), in which several key compiler passes have been formally verified using the Coq proof assistant. Because of the probabilistic nature of PPLs, bugs in their compilers can be difficult to detect and fix, making verification an interesting possibility. However, proving correctness of PPL compilation requires new techniques because certain transformations performed by compilers for PPLs are quite different from other kinds of languages. This paper describes techniques for verifying such transformations and their application in ProbCompCert. In the course of verifying ProbCompCert, we found an error in the Stan language reference manual related to the semantics and implementation of a key language construct.

Funder

NSF

Publisher

Association for Computing Machinery (ACM)

Subject

Safety, Risk, Reliability and Quality,Software

Link

https://dl.acm.org/doi/pdf/10.1145/3591245

Reference38 articles.

1. AcMC 2

2. Reactive probabilistic programming

3. Matthew R. Becker. 2016. NUTS Sampler Broken (stan-dev/stan issue #2178). https://github.com/stan-dev/stan/issues/2178 Matthew R. Becker. 2016. NUTS Sampler Broken (stan-dev/stan issue #2178). https://github.com/stan-dev/stan/issues/2178

4. Michael Betancourt. 2018. A Conceptual Introduction to Hamiltonian Monte Carlo. arxiv:1701.02434. Michael Betancourt. 2018. A Conceptual Introduction to Hamiltonian Monte Carlo. arxiv:1701.02434.

5. Sooraj Bhat , Johannes Borgström , Andrew D. Gordon , and Claudio Russo . 2013. Deriving Probability Density Functions from Probabilistic Functional Programs . In Tools and Algorithms for the Construction and Analysis of Systems, Nir Piterman and Scott A . Smolka (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg . 508–522. isbn:978-3-642-36742-7 Sooraj Bhat, Johannes Borgström, Andrew D. Gordon, and Claudio Russo. 2013. Deriving Probability Density Functions from Probabilistic Functional Programs. In Tools and Algorithms for the Construction and Analysis of Systems, Nir Piterman and Scott A. Smolka (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 508–522. isbn:978-3-642-36742-7

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. From Mechanized Semantics to Verified Compilation: the Clight Semantics of CompCert;Lecture Notes in Computer Science;2024