PLVNET
I'm really happy to be part of the first PLVNET, a workshop on the intersection of PL, verification, and networking. I have two abstracts up for discussion.
The first abstract, Temporal NetKAT, is about adding reasoning about packet histories to a network policy language like NetKAT. The work on this is moving along quite nicely (thanks in large part to Ryan Beckett!), and I'm looking forward to the conversations it will spark.
The second abstract, Type systems for SDN controllers, is about using type systems to statically guarantee the absence of errors in controller programs. Fancy new switches have tons of features, which can be tricky to operate---can we make sure that a controller doesn't make any mistakes when it talks to a switch? Some things are easy, like making sure that the match/action rules are sent to tables that can handle them; some things are harder, like making sure the controller doesn't fill up a switch's tables. I think this kind of work is a nice complement to the NetKAT "whole policy" approach, a sort of OpenFlow 1.3+ version of VeriCon with slightly different goals.
Should be fun!