{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:46:46Z","timestamp":1780994806620,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,1,8]],"date-time":"2014-01-08T00:00:00Z","timestamp":1389139200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,1,8]]},"DOI":"10.1145\/2535838.2535862","type":"proceedings-article","created":{"date-parts":[[2014,1,14]],"date-time":"2014-01-14T08:40:06Z","timestamp":1389688806000},"page":"113-126","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":233,"title":["NetKAT"],"prefix":"10.1145","author":[{"given":"Carolyn Jane","family":"Anderson","sequence":"first","affiliation":[{"name":"Swarthmore College, Swarthmore, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nate","family":"Foster","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arjun","family":"Guha","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Baptiste","family":"Jeannin","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dexter","family":"Kozen","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cole","family":"Schlesinger","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Walker","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2014,1,8]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1866898.1866905"},{"key":"e_1_3_2_2_3_1","volume-title":"Telcordia","author":"Cohen Ernie","year":"1994","unstructured":"Ernie Cohen . Using Kleene algebra to reason about concurrency control. Technical report , Telcordia , Morristown , N.J. , 1994 . Ernie Cohen. Using Kleene algebra to reason about concurrency control. Technical report, Telcordia, Morristown, N.J., 1994."},{"key":"e_1_3_2_2_4_1","volume-title":"Regular Algebra and Finite Machines","author":"Conway John Horton","year":"1971","unstructured":"John Horton Conway . Regular Algebra and Finite Machines . Chapman and Hall , London , 1971 . John Horton Conway. Regular Algebra and Finite Machines. Chapman and Hall, London, 1971."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486003"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2034773.2034812"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462178"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2342441.2342458"},{"key":"e_1_3_2_2_9_1","volume-title":"December","author":"Hamilton James","year":"2009","unstructured":"James Hamilton . Networking: The last bastion of mainframe computing , December 2009 . Available at http:\/\/tinyurl.com\/y9uz64e. James Hamilton. Networking: The last bastion of mainframe computing, December 2009. Available at http:\/\/tinyurl.com\/y9uz64e."},{"key":"e_1_3_2_2_10_1","volume-title":"NSDI","author":"Kazemian Peyman","year":"2012","unstructured":"Peyman Kazemian , George Varghese , and Nick McKeown . Header space analysis: Static checking for networks . In NSDI , 2012 . Peyman Kazemian, George Varghese, and Nick McKeown. Header space analysis: Static checking for networks. In NSDI, 2012."},{"key":"e_1_3_2_2_11_1","volume-title":"NSDI","author":"Khurshid Ahmed","year":"2013","unstructured":"Ahmed Khurshid , Xuan Zou , Wenxuan Zhou , Matthew Caesar , and P. Brighten Godfrey . VeriFlow: Verifying network-wide invariants in real time . In NSDI , 2013 . Ahmed Khurshid, Xuan Zou, Wenxuan Zhou, Matthew Caesar, and P. Brighten Godfrey. VeriFlow: Verifying network-wide invariants in real time. In NSDI, 2013."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1037"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/646480.693788"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/256167.256195"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/647482.728262"},{"key":"e_1_3_2_2_17_1","volume-title":"CSL","author":"Kozen Dexter","year":"1996","unstructured":"Dexter Kozen and Frederick Smith . Kleene algebra with tests: Completeness and decidability . In CSL , September 1996 . Dexter Kozen and Frederick Smith. Kleene algebra with tests: Completeness and decidability. In CSL, September 1996."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1090191.1080126"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043164.2018470"},{"key":"e_1_3_2_2_20_1","volume-title":"ONS","author":"McCauley James","year":"2013","unstructured":"James McCauley , Aurojit Panda , Martin Casado , Teemu Koponen , and Scott Shenker . Extending SDN to large-scale networks . In ONS , 2013 . James McCauley, Aurojit Panda, Martin Casado, Teemu Koponen, and Scott Shenker. Extending SDN to large-scale networks. In ONS, 2013."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355746"},{"key":"e_1_3_2_2_22_1","volume-title":"Proc. IFIP TC2\/WG2.1 Working Conference","author":"M\u00f6ller B.","year":"1997","unstructured":"B. M\u00f6ller . Calculating with pointer structures. In Algorithmic Languages and Calculi . Proc. IFIP TC2\/WG2.1 Working Conference , February 1997 . B. M\u00f6ller. Calculating with pointer structures. In Algorithmic Languages and Calculi. Proc. IFIP TC2\/WG2.1 Working Conference, February 1997."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103685"},{"key":"e_1_3_2_2_24_1","volume-title":"NSDI","author":"Monsanto Christopher","year":"2013","unstructured":"Christopher Monsanto , Joshua Reich , Nate Foster , Jennifer Rexford , and David Walker . Composing software-defined networks . In NSDI , April 2013 . Christopher Monsanto, Joshua Reich, Nate Foster, Jennifer Rexford, and David Walker. Composing software-defined networks. In NSDI, April 2013."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491185.2491201"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342427"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.806121"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511778810","volume-title":"Relational Mathematics","author":"Schmidt Gunther","year":"2010","unstructured":"Gunther Schmidt . Relational Mathematics . Cambridge University Press , 2010 . Gunther Schmidt. Relational Mathematics. Cambridge University Press, 2010."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/28659.28685"},{"key":"e_1_3_2_2_30_1","unstructured":"The Frenetic Project 2013. See http:\/\/frenetic-lang.org.  The Frenetic Project 2013. See http:\/\/frenetic-lang.org."},{"key":"e_1_3_2_2_31_1","volume-title":"PADL","author":"Voellmy Andreas","year":"2011","unstructured":"Andreas Voellmy and Paul Hudak . Nettle : Functional reactive programming of OpenFlow networks . In PADL , 2011 . Andreas Voellmy and Paul Hudak. Nettle: Functional reactive programming of OpenFlow networks. In PADL, 2011."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486030"},{"key":"e_1_3_2_2_33_1","volume-title":"HotNets","author":"Wang Anduo","year":"2009","unstructured":"Anduo Wang , Limin Jia , Changbin Liu , Boon Thau Loo , Oleg Sokolsky , and Prithwish Basu . Formally verifiable networking . In HotNets , 2009 . Anduo Wang, Limin Jia, Changbin Liu, Boon Thau Loo, Oleg Sokolsky, and Prithwish Basu. Formally verifiable networking. In HotNets, 2009."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2011.5936161"}],"event":{"name":"POPL '14: The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"San Diego California USA","acronym":"POPL '14","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2535838.2535862","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2535838.2535862","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:10:06Z","timestamp":1750219806000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2535838.2535862"}},"subtitle":["semantic foundations for networks"],"short-title":[],"issued":{"date-parts":[[2014,1,8]]},"references-count":32,"alternative-id":["10.1145\/2535838.2535862","10.1145\/2535838"],"URL":"https:\/\/doi.org\/10.1145\/2535838.2535862","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2578855.2535862","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2014,1,8]]},"assertion":[{"value":"2014-01-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}