Deciding Probabilistic Program Equivalence in NetKAT

07/10/2017
by   Steffen Smolka, et al.
0

We tackle the problem of deciding whether a pair of probabilistic programs are equivalent in the context of Probabilistic NetKAT, a formal language for reasoning about the behavior of packet-switched networks. We show that the problem is decidable for the history-free fragment of the language. The main challenge lies in reasoning about iteration, which we address by a reduction to finite-state absorbing Markov chains. This approach naturally leads to an effective decision procedure based on stochastic matrices that we have implemented in an OCaml prototype. We demonstrate how to use this prototype to reason about probabilistic network programs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/17/2019

Scalable Verification of Probabilistic Networks

This paper presents McNetKAT, a scalable tool for verifying probabilisti...
research
05/10/2022

A Specification Logic for Programs in the Probabilistic Guarded Command Language (Extended Version)

The semantics of probabilistic languages has been extensively studied, b...
research
09/09/2019

On the Strong Equivalences for LPMLN Programs

LPMLN is a powerful knowledge representation and reasoning tool that com...
research
05/02/2018

A Probabilistic Extension of Action Language BC+

We present a probabilistic extension of action language BC+. Just like B...
research
05/08/2014

Joint Tabling of Logic Program Abductions and Updates

Abductive logic programs offer a formalism to declaratively represent an...
research
04/11/2018

Constraint-Based Synthesis of Coupling Proofs

Proof by coupling is a classical technique for proving properties about ...
research
07/08/2018

Contextual Equivalence for a Probabilistic Language with Continuous Random Variables and Recursion

We present a complete reasoning principle for contextual equivalence in ...

Please sign up or login with your details

Forgot password? Click here to reset