A Theory of Slicing for Probabilistic Control Flow Graphs

8 years 23 days ago

Download people.cis.ksu.edu

The task of program slicing is to remove the parts of a program that are irrelevant in a given context. In probabilistic programs, where variables may be assigned random values from a given distribution, and undesirable combinations of values may be removed by “observe” statements, the standard notions of data and control dependence no longer suﬃce for semantically correct slicing, as demonstrated by Hur et al. in recent work. This paper presents a theory for slicing probabilistic programs, represented as control ﬂow graphs whose nodes transform probability distributions. We separate the speciﬁcation of slicing from its implementation: ﬁrst we develop syntactic conditions that a slice must satisfy; next we prove that any such slice is semantically correct; ﬁnally we give an algorithm to compute the least slice. We state correctness in terms of observational equivalence between the behaviors of the sliced program and of the original. A program’s behavior is its ﬁnal p...

Torben Amtoft, Anindya Banerjee

Real-time Traffic