Network verification has recently gained popularity in the programming languages and verification community. Much of the recent work in this area has focused on verifying the behavior of simple networks, whose actions are dictated by static, immutable rules configured ahead of time. However, in reality, modern networks contain a variety of middleboxes, whose behavior is affected both by their configuration and by mutable state updated in response to packets received by them. In this position paper we critically review recent progress on network verification, propose some next steps towards a more complete form of network verification, dispel some myths about networks, provide a more formal description of our approach, and end with a discussion of the formal questions posed to this community by the network verification agenda.
|Original language||American English|
|Title of host publication||1st Summit on Advances in Programming Languages, SNAPL 2015|
|Editors||Thomas Ball, Rastislav Bodik, Benjamin S. Lerner, Greg Morrisett, Shriram Krishnamurthi|
|Publisher||Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing|
|Number of pages||12|
|State||Published - 1 May 2015|
|Event||1st Summit on Advances in Programming Languages, SNAPL 2015 - Asilomar, United States|
Duration: 3 May 2015 → 6 May 2015
|Name||Leibniz International Proceedings in Informatics, LIPIcs|
|Conference||1st Summit on Advances in Programming Languages, SNAPL 2015|
|Period||3/05/15 → 6/05/15|
Bibliographical noteFunding Information:
We thank Ori Lahav for help with the RONO proof. We also thank Cole Schlesinger, Aditya Akella, Shriram Krishnamurthi and Nate Foster for help debugging parts of the RONO proof. We are grateful to Justine Sherry, Colin Scott and the anonymous reviewers for their comments and suggestion on this paper. This research is supported in part by NSF grants 1420064, 1343947, 1040838; ISF grant 420/12; Israel Ministry of Science Grant 3-9772; a Marie Curie Career Integration Grant; the Israeli Center for Research Excellence in Algorithms; and by funding from Intel and AT&T.
- Mutable dataplane
- Network verification