A Fixed Point Iteration Technique for Proving Correctness of Slicing for Probabilistic Programs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913604205281280 |
|---|---|
| author | Amtoft, Torben Banerjee, Anindya |
| author_facet | Amtoft, Torben Banerjee, Anindya |
| contents | When proving the correctness of a method for slicing probabilistic programs, it was previously discovered by the authors that for a fixed point iteration to work one needs a non-standard starting point for the iteration.
This paper presents and explores this technique in a general setting; it states the lemmas that must be established to use the technique to prove the correctness of a program transformation, and sketches how to apply the technique to slicing of probabilistic programs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_07086 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Fixed Point Iteration Technique for Proving Correctness of Slicing for Probabilistic Programs Amtoft, Torben Banerjee, Anindya Programming Languages When proving the correctness of a method for slicing probabilistic programs, it was previously discovered by the authors that for a fixed point iteration to work one needs a non-standard starting point for the iteration. This paper presents and explores this technique in a general setting; it states the lemmas that must be established to use the technique to prove the correctness of a program transformation, and sketches how to apply the technique to slicing of probabilistic programs. |
| title | A Fixed Point Iteration Technique for Proving Correctness of Slicing for Probabilistic Programs |
| topic | Programming Languages |
| url | https://arxiv.org/abs/2412.07086 |