arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1607.03455cs.PLcs.LO
收藏

耦合证明是概率乘积程序

Coupling proofs are probabilistic product programs

Gilles Barthe, Benjamin Grégoire, Justin Hsu, Pierre-Yves Strub

摘要:

耦合是一个强有力的数学工具,用于推理概率过程对。形式化验证的最新发展确定了耦合和pRHL之间的密切联系,pRHL是一种关系程序逻辑,由可证明安全性的应用程序驱动,使耦合从概率论文献中正式构建。然而,现有的工作,使用pRHL只显示存在的耦合,并没有给出一种方法来证明定量的属性的耦合,这是需要的原因混合和收敛的概率过程。此外,pRHL本质上是不完整的,并且不能捕获一些高级形式的耦合,例如移位耦合。我们对这两个问题的处理如下。首先,我们定义了一个扩展的pRHL,称为xpRHL,它明确地构建了耦合在一个pRHL衍生的形式的概率产品程序,模拟两个相关的运行的原始程序。现有的概率程序验证工具,然后可以直接应用到概率产品,以证明耦合的定量属性。其次,我们配备了一个新的规则,而循环,推理可以自由地混合同步和非同步循环迭代pRHL。我们的证明规则可以捕获移位耦合的例子,并且对于确定性程序,逻辑相对完整。我们显示的xpRHL的合理性,并用它来分析两类例子。首先,我们验证快速混合使用不同的工具从耦合:标准耦合,移位耦合,路径耦合,组合的原则,结合本地耦合到一个全球性的耦合。其次,我们验证(近似)之间的等价性源和优化程序的几个实例循环优化从文献。

英文摘要:

Couplings are a powerful mathematical tool for reasoning about pairs of probabilistic processes. Recent developments in formal verification identify a close connection between couplings and pRHL, a relational program logic motivated by applications to provable security, enabling formal construction of couplings from the probability theory literature. However, existing work using pRHL merely shows existence of a coupling and does not give a way to prove quantitative properties about the coupling, which are need to reason about mixing and convergence of probabilistic processes. Furthermore, pRHL is inherently incomplete, and is not able to capture some advanced forms of couplings such as shift couplings. We address both problems as follows. First, we define an extension of pRHL, called xpRHL, which explicitly constructs the coupling in a pRHL derivation in the form of a probabilistic product program that simulates two correlated runs of the original program. Existing verification tools for probabilistic programs can then be directly applied to the probabilistic product to prove quantitative properties of the coupling. Second, we equip pRHL with a new rule for while loops, where reasoning can freely mix synchronized and unsynchronized loop iterations. Our proof rule can capture examples of shift couplings, and the logic is relatively complete for deterministic programs. We show soundness of xpRHL and use it to analyze two classes of examples. First, we verify rapid mixing using different tools from coupling: standard coupling, shift coupling, and path coupling, a compositional principle for combining local couplings into a global coupling. Second, we verify (approximate) equivalence between a source and an optimized program for several instances of loop optimizations from the literature.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑