Explaining SDN Failures via Axiomatisations

09/04/2019
by   Georgiana Caltais, et al.
0

This work introduces a concept of explanations with respect to the violation of safe behaviours within software defined networks (SDNs) expressible in NetKAT. The latter is a network programming language that is based on a well-studied mathematical structure, namely, Kleene Algebra with Tests (KAT). Amongst others, the mathematical foundation of NetKAT gave rise to a sound and complete equational theory. In our setting, a safe behaviour is characterised by a NetKAT policy which does not enable forwarding packets from ingress to an undesirable egress. Explanations for safety violations are derived in an equational fashion, based on a modification of the existing NetKAT axiomatisation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/24/2021

Explaining Safety Failures in NetKAT

This work introduces a concept of explanations with respect to the viola...
research
02/19/2021

DyNetKAT: An Algebra of Dynamic Networks

We introduce a formal language for specifying dynamic updates for Softwa...
research
06/11/2022

Rust: The Programming Language for Safety and Performance

Rust is a young programming language gaining increased attention from so...
research
06/07/2022

Q# as a Quantum Algorithmic Language

Q# is a standalone domain-specific programming language from Microsoft f...
research
05/09/2023

Pure Data Foundation of Mathematics and Computing

We propose an axiomatic foundation of mathematics based on the finite se...
research
01/29/2020

A Type and Scope Safe Universe of Syntaxes with Binding: Their Semantics and Proofs

Almost every programming language's syntax includes a notion of binder a...

Please sign up or login with your details

Forgot password? Click here to reset