A Fixed Point Iteration Technique for Proving Correctness of Slicing for Probabilistic Programs

Autor:	Amtoft, Torben, Banerjee, Anindya
Rok vydání:	2024
Předmět:	Computer Science - Programming Languages
Druh dokumentu:	Working Paper
Popis:	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. Comment: To be published by Springer in Festschrift for Alan Mycroft
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2412.07086 Zobrazit plný text záznamu View this record from Arxiv