跳到主要导航 跳到搜索 跳到主要内容

An Algebraic Approach to Automatic Reasoning for NetKAT Based on Its Operational Semantics

  • East China Normal University

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

NetKAT is a network programming language with a solid mathematical foundation. In this paper, we present an operational semantics and show that it is sound and complete with respect to its original axiomatic semantics. We achieve automatic reasoning for NetKAT such as reachability analysis and model checking of temporal properties, by formalizing the operational semantics in an algebraic executable specification language called Maude. In addition, as NetKAT policies are normalizable, two policies are operationally equivalent if and only if they can be converted into the same normal form. We provide a formal way of reasoning about network properties by turning the equivalence checking problem of NetKAT policies into the normalization problem that can be automated in Maude.

源语言英语
主期刊名Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, ICFEM 2017, Proceedings
编辑Zhenhua Duan, Luke Ong
出版商Springer Verlag
464-480
页数17
ISBN(印刷版)9783319686899
DOI
出版状态已出版 - 2017
活动19th International Conference on Formal Engineering Methods, ICFEM 2017 - Xi'an, 中国
期限: 13 11月 201717 11月 2017

出版系列

姓名Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
10610 LNCS
ISSN(印刷版)0302-9743
ISSN(电子版)1611-3349

会议

会议19th International Conference on Formal Engineering Methods, ICFEM 2017
国家/地区中国
Xi'an
时期13/11/1717/11/17

指纹

探究 'An Algebraic Approach to Automatic Reasoning for NetKAT Based on Its Operational Semantics' 的科研主题。它们共同构成独一无二的指纹。

引用此