Equivalence and similarity refutation for probabilistic programs
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 implementati...
Saved in:
Main Authors: | CHATTERJEE, Krishnendu, GOHARSHADY, Ehsan Kafshdar, NOVOTNÝ, Petr, ZIKELIC, Dorde |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2025
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/9063 https://ink.library.smu.edu.sg/context/sis_research/article/10066/viewcontent/3656462.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Stochastic invariants for probabilistic termination
by: CHATTERJEE, Krishnendu, et al.
Published: (2017) -
Quantitative bounds on resource usage of probabilistic programs
by: CHATTERJEE, Krishnendu, et al.
Published: (2026) -
On lexicographic proof rules for probabilistic termination
by: CHATTERJEE, Krishnendu, et al.
Published: (2025) -
On lexicographic proof rules for probabilistic termination
by: CHATTERJEE, Krishnendu, et al.
Published: (2021) -
Proving non-termination by program reversal
by: CHATTERJEE, Krishnendu, et al.
Published: (2021)