We present MatchKAT, an algebraic language for modeling match-action packet processing in network switches. Although the match-action paradigm has remained a popular low-level programming model for specifying packet forwarding behavior, little has been done towards giving it formal semantics. With MatchKAT, we hope to embark on the first steps in exploring how network programs compiled to match-action rules can be reasoned about formally in a reliable, algebraic way. In this paper, we give details of MatchKAT and its metatheory, as well as a formal treatment of match expressions on binary strings that form the basis of "match" in match-action. Through a correspondence with NetKAT, we show that MatchKAT's equational theory is sound and complete with regards to a similar packet filtering semantics. We also demonstrate the complexity of deciding equivalence in MatchKAT is PSPACE-complete.

中文翻译：

---

MatchKAT：比赛动作的代数基础

我们介绍MatchKAT，这是一种代数语言，用于对网络交换机中的匹配动作数据包处理进行建模。尽管匹配动作范例仍然是用于指定数据包转发行为的流行的低级编程模型，但是在赋予它正式的语义方面做得很少。希望借助MatchKAT迈出第一步，探索如何以可靠，代数的方式正式推理根据匹配规则编写的网络程序。在本文中，我们将提供MatchKAT及其元理论的详细信息，以及对形成匹配操作中“匹配”基础的二进制字符串上的匹配表达式的形式化处理。通过与NetKAT的对应关系，我们显示出MatchKAT的等式理论在类似的数据包过滤语义方面是健全且完整的。