Program logic for higher-order probabilistic programs in Isabelle/HOL

被引:0
|
作者
Hirata, Michikazu [1 ]
Minamide, Yasuhiko [1 ]
Sato, Tetsuya [1 ]
机构
[1] Tokyo Inst Technol, Sch Comp, Meguro ku 2-12-1, Tokyo 1528550, Japan
关键词
Higher-order probabilistic programming; language; Program logic; Formal verification; Quasi -Borel spaces; Isabelle; HOL;
D O I
10.1016/j.scico.2023.102993
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The verification framework PPV (Probabilistic Program Verification) verifies functional probabilistic programs supporting higher-order functions, continuous distributions, and conditional inference. PPV is based on the theory of quasi-Borel spaces which is introduced to give a semantics of higher-order probabilistic programming languages with continuous distributions. In this paper, we formalize a theory of quasi-Borel spaces and a core part of PPV in Isabelle/HOL. We first construct a probability monad on quasi-Borel spaces based on the Giry monad in the Isabelle/HOL library. Our formalization of PPV is extended so that integrability of functions can be discussed formally. Finally, we prove integrability and convergence of the Monte Carlo approximation in our mechanized PPV.& COPY; 2023 Elsevier B.V. All rights reserved.
引用
收藏
页数:17
相关论文
共 50 条
  • [21] Asynchronous Probabilistic Couplings in Higher-Order Separation Logic
    Gregersen, Simon Oddershede
    Aguirre, Alejandro
    Haselwarter, Philipp G.
    Tassarotti, Joseph
    Birkedal, Lars
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2024, 8 (POPL):
  • [22] EXECUTING HOL SPECIFICATIONS - TOWARDS AN EVALUATION SEMANTICS FOR CLASSICAL HIGHER-ORDER LOGIC
    RAJAN, PS
    IFIP TRANSACTIONS A-COMPUTER SCIENCE AND TECHNOLOGY, 1993, 20 : 527 - 536
  • [23] λPSI: Exact Inference for Higher-Order Probabilistic Programs
    Gehr, Timon
    Steffen, Samuel
    Vechev, Martin
    PROCEEDINGS OF THE 41ST ACM SIGPLAN CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION (PLDI '20), 2020, : 883 - 897
  • [24] On the Termination Problem for Probabilistic Higher-Order Recursive Programs
    Kobayashi, Naoki
    Dal Lago, Ugo
    Grellois, Charles
    2019 34TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2019,
  • [25] On Coinductive Equivalences for Higher-Order Probabilistic Functional Programs
    Dal Lago, Ugo
    Sangiorgi, Davide
    Alberti, Michele
    ACM SIGPLAN NOTICES, 2014, 49 (01) : 297 - 308
  • [26] ON THE TERMINATION PROBLEM FOR PROBABILISTIC HIGHER-ORDER RECURSIVE PROGRAMS
    Kobayashi, Naoki
    Dal Lago, Ugo
    Grellois, Charles
    LOGICAL METHODS IN COMPUTER SCIENCE, 2020, 16 (04) : 1 - 57
  • [27] Automating Free Logic in Isabelle/HOL
    Benzmueller, Christoph
    Scott, Dana
    MATHEMATICAL SOFTWARE, ICMS 2016, 2016, 9725 : 43 - 50
  • [28] Logic-flow analysis of higher-order programs
    Might, Matthew
    ACM SIGPLAN NOTICES, 2007, 42 (01) : 185 - 198
  • [29] Propositional Dynamic Logic for Higher-Order Functional Programs
    Satake, Yuki
    Unno, Hiroshi
    COMPUTER AIDED VERIFICATION (CAV 2018), PT I, 2018, 10981 : 105 - 123
  • [30] Predicate Specialization for Definitional Higher-Order Logic Programs
    Troumpoukis, Antonis
    Charalambidis, Angelos
    LOGIC-BASED PROGRAM SYNTHESIS AND TRANSFORMATION, LOPSTR 2018, 2019, 11408 : 132 - 147