A Fixed Point Iteration Technique for Proving Correctness of Slicing for Probabilistic Programs
- 25 November 2025
- book chapter
- Published by Springer Nature
- p. 101-113
Abstract
No abstract availableKeywords
All Related Versions
This publication has 5 references indexed in Scilit:
- A Theory of Slicing for Imperative Probabilistic ProgramsACM Transactions on Programming Languages and Systems, 2020
- Probabilistic programming2014
- A unifying theory of control dependence and its application to arbitrary program structuresTheoretical Computer Science, 2011
- The Formal Semantics of Programming Languages1993
- Semantics of probabilistic programsJournal of Computer and System Sciences, 1981