Equivalence and Similarity Refutation for Probabilistic Programs

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F24%3A00139770" target="_blank" >RIV/00216224:14330/24:00139770 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1145/3656462" target="_blank" >http://dx.doi.org/10.1145/3656462</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1145/3656462" target="_blank" >10.1145/3656462</a>

Result language

angličtina

Original language name

Equivalence and Similarity Refutation for Probabilistic Programs

Original language description

We consider the problems of statically refuting equivalence and similarity of output distributions defined by a pair of probabilistic programs. Equivalence and similarity are two fundamental relational properties of probabilistic programs that are essential for their correctness both in implementation and in compilation. In this work, we present a new method for static equivalence and similarity refutation. Our method refutes equivalence and similarity by computing a function over program outputs whose expected value with respect to the output distributions of two programs is different. The function is computed simultaneously with an upper expectation supermartingale and a lower expectation submartingale for the two programs, which we show to together provide a formal certificate for refuting equivalence and similarity. To the best of our knowledge, our method is the first approach to relational program analysis to offer the combination of the following desirable features: (1) it is fully automated, (2) it is applicable to infinite-state probabilistic programs, and (3) it provides formal guarantees on the correctness of its results. We implement a prototype of our method and our experiments demonstrate the effectiveness of our method to refute equivalence and similarity for a number of examples collected from the literature.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/GA23-06963S" target="_blank" >GA23-06963S: VESCAA: Verifiable and Efficient Synthesis of Controllers for Autonomous Agents</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2024

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Proceedings of the ACM on Programming Languages, Volume 8, Issue ACM SIGPLAN Conference on Programming Languages Design and Implementation (PLDI 2024)

ISBN

—

ISSN

2475-1421

e-ISSN

—

Number of pages

25

Pages from-to

2098-2122

Publisher name

ACM

Place of publication

New York

Event location

New York

Event date

Jan 1, 2024

Type of event by nationality

CST - Celostátní akce

UT code for WoS article

001264464100087