{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T10:52:04Z","timestamp":1777459924772,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,12,4]],"date-time":"2018-12-04T00:00:00Z","timestamp":1543881600000},"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":[[2018,12,4]]},"DOI":"10.1145\/3281411.3281432","type":"proceedings-article","created":{"date-parts":[[2018,11,28]],"date-time":"2018-11-28T19:16:10Z","timestamp":1543432570000},"page":"217-227","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["P-Rex"],"prefix":"10.1145","author":[{"given":"Jesper Stenbjerg","family":"Jensen","sequence":"first","affiliation":[{"name":"Aalborg University, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Troels Beck","family":"Kr\u00f8gh","sequence":"additional","affiliation":[{"name":"Aalborg University, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonas Sand","family":"Madsen","sequence":"additional","affiliation":[{"name":"Aalborg University, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"University of Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji\u0159\u00ed","family":"Srba","sequence":"additional","affiliation":[{"name":"Aalborg University, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc Tom","family":"Thorgersen","sequence":"additional","affiliation":[{"name":"Aalborg University, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,12,4]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2578855.2535862"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Alia K Atlas and Alex Zinin. 2008. Basic specification for IP fast-reroute: loop-free alternates. IETF RFC 5286.  Alia K Atlas and Alex Zinin. 2008. Basic specification for IP fast-reroute: loop-free alternates. IETF RFC 5286.","DOI":"10.17487\/rfc5286"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098834"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098834"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934909"},{"key":"e_1_3_2_2_6_1","first-page":"529","article-title":"Canonical regular expressions and minimal state graphs for definite events","volume":"12","author":"Brzozowski J.A.","year":"1962","unstructured":"J.A. Brzozowski . 1962 . Canonical regular expressions and minimal state graphs for definite events . Mathematical Theory of Automata 12 (1962), 529 -- 561 . J.A. Brzozowski. 1962. Canonical regular expressions and minimal state graphs for definite events. Mathematical Theory of Automata 12 (1962), 529--561.","journal-title":"Mathematical Theory of Automata"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01969548"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63390-9_14"},{"key":"e_1_3_2_2_9_1","volume-title":"Proc. 15th USENIX Symposium on Networked Systems Design and Implementation (NSDI). USENIX Association, 579--594","author":"El-Hassany Ahmed","year":"2018","unstructured":"Ahmed El-Hassany , Petar Tsankov , Laurent Vanbever , and Martin Vechev . 2018 . NetComplete: Practical Network-Wide Configuration Synthesis with Autocompletion . In Proc. 15th USENIX Symposium on Networked Systems Design and Implementation (NSDI). USENIX Association, 579--594 . Ahmed El-Hassany, Petar Tsankov, Laurent Vanbever, and Martin Vechev. 2018. NetComplete: Practical Network-Wide Configuration Synthesis with Autocompletion. In Proc. 15th USENIX Symposium on Networked Systems Design and Implementation (NSDI). USENIX Association, 579--594."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848157"},{"key":"e_1_3_2_2_11_1","volume-title":"Efficient Algorithms for Model Checking Pushdown Systems. In Proc. 12th International Conference on Computer Aided Verification (CAV) (LNCS)","volume":"1855","author":"Esparza J.","unstructured":"J. Esparza , D. Hansel , P. Rossmanith , and S. Schwoon . 2000 . Efficient Algorithms for Model Checking Pushdown Systems. In Proc. 12th International Conference on Computer Aided Verification (CAV) (LNCS) , Vol. 1855 . Springer, 232--247. J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. 2000. Efficient Algorithms for Model Checking Pushdown Systems. In Proc. 12th International Conference on Computer Aided Verification (CAV) (LNCS), Vol. 1855. Springer, 232--247."},{"key":"e_1_3_2_2_12_1","volume-title":"Proc. 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI). USENIX Association, 217--232","author":"Fayaz Seyed K","year":"2016","unstructured":"Seyed K Fayaz , Tushar Sharma , Ari Fogel , Ratul Mahajan , Todd Millstein , Vyas Sekar , and George Varghese . 2016 . Efficient Network Reachability Analysis using a Succinct Control Plane Representation . In Proc. 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI). USENIX Association, 217--232 . Seyed K Fayaz, Tushar Sharma, Ari Fogel, Ratul Mahajan, Todd Millstein, Vyas Sekar, and George Varghese. 2016. Efficient Network Reachability Analysis using a Succinct Control Plane Representation. In Proc. 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI). USENIX Association, 217--232."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2775051.2677011"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934876"},{"key":"e_1_3_2_2_15_1","unstructured":"Juniper. 2018. Show Route Forwarding-Table. Technical Documentation https:\/\/www.juniper.net\/documentation\/en_US\/junos\/topics\/reference\/command-summary\/show-route-forwarding-table.html.  Juniper. 2018. Show Route Forwarding-Table. Technical Documentation https:\/\/www.juniper.net\/documentation\/en_US\/junos\/topics\/reference\/command-summary\/show-route-forwarding-table.html."},{"key":"e_1_3_2_2_16_1","volume-title":"Undecidable Problems for Probabilistic Network Programming. In MFCS'17","volume":"83","author":"Kahn David M","year":"2017","unstructured":"David M Kahn . 2017 . Undecidable Problems for Probabilistic Network Programming. In MFCS'17 , Vol. 83 . LIPIcs-Leibniz International Proceedings in Informatics, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 1--16. David M Kahn. 2017. Undecidable Problems for Probabilistic Network Programming. In MFCS'17, Vol. 83. LIPIcs-Leibniz International Proceedings in Informatics, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 1--16."},{"key":"e_1_3_2_2_17_1","volume-title":"Proc. 9th USENIX Conference on Networked Systems Design and Implementation (NSDI). USENIX Association, 113--126","author":"Kazemian Peyman","year":"2012","unstructured":"Peyman Kazemian , George Varghese , and Nick McKeown . 2012 . Header Space Analysis: Static Checking for Networks . In Proc. 9th USENIX Conference on Networked Systems Design and Implementation (NSDI). USENIX Association, 113--126 . Peyman Kazemian, George Varghese, and Nick McKeown. 2012. Header Space Analysis: Static Checking for Networks. In Proc. 9th USENIX Conference on Networked Systems Design and Implementation (NSDI). USENIX Association, 113--126."},{"key":"e_1_3_2_2_18_1","volume-title":"Proc. 10th USENIX Symposium on Networked Systems Design and Implementation (NSDI). USENIX Association, 15--27","author":"Khurshid Ahmed","year":"2013","unstructured":"Ahmed Khurshid , Xuan Zou , Wenxuan Zhou , Matthew Caesar , and P Brighten Godfrey . 2013 . Veriflow: Verifying network-wide invariants in real time . In Proc. 10th USENIX Symposium on Networked Systems Design and Implementation (NSDI). USENIX Association, 15--27 . Ahmed Khurshid, Xuan Zou, Wenxuan Zhou, Matthew Caesar, and P Brighten Godfrey. 2013. Veriflow: Verifying network-wide invariants in real time. In Proc. 10th USENIX Symposium on Networked Systems Design and Implementation (NSDI). USENIX Association, 15--27."},{"key":"e_1_3_2_2_19_1","volume-title":"Proc. 20th International Conference on Principles of Distributed Systems (OPODIS). Schloss Dagstuhl. Leibniz-Zentrum f\u00c3ijr Informatik, 1--18","author":"Larsen Kim G.","year":"2016","unstructured":"Kim G. Larsen , Stefan Schmid , and Bingtian Xue . 2016 . WNetKAT: A Weighted SDN Programming and Verification Language . In Proc. 20th International Conference on Principles of Distributed Systems (OPODIS). Schloss Dagstuhl. Leibniz-Zentrum f\u00c3ijr Informatik, 1--18 . Kim G. Larsen, Stefan Schmid, and Bingtian Xue. 2016. WNetKAT: A Weighted SDN Programming and Verification Language. In Proc. 20th International Conference on Principles of Distributed Systems (OPODIS). Schloss Dagstuhl. Leibniz-Zentrum f\u00c3ijr Informatik, 1--18."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043164.2018470"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2020981"},{"key":"e_1_3_2_2_22_1","unstructured":"RFC 8001. 2017. RSVP-TE Extensions for Collecting Shared Risk Link Group (SRLG). https:\/\/datatracker.ietf.org\/doc\/rfc8001\/.  RFC 8001. 2017. RSVP-TE Extensions for Collecting Shared Risk Link Group (SRLG). https:\/\/datatracker.ietf.org\/doc\/rfc8001\/."},{"key":"e_1_3_2_2_23_1","volume-title":"Polynomial-Time What-If Analysis for Prefix-Manipulating MPLS Networks. In IEEE International Conference on Computer Communications (INFOCOM'18)","author":"Schmid Stefan","year":"2018","unstructured":"Stefan Schmid and Ji\u0159\u00ed Srba . 2018 . Polynomial-Time What-If Analysis for Prefix-Manipulating MPLS Networks. In IEEE International Conference on Computer Communications (INFOCOM'18) . IEEE, 1--9. Stefan Schmid and Ji\u0159\u00ed Srba. 2018. Polynomial-Time What-If Analysis for Prefix-Manipulating MPLS Networks. In IEEE International Conference on Computer Communications (INFOCOM'18). IEEE, 1--9."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/363347.363387"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2187924"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2004.1301021"},{"key":"e_1_3_2_2_28_1","volume-title":"Proc. 11th USENIX Symposium on Networked Systems Design and Implementation (NSDI). USENIX Association, 87--99","author":"Zeng Hongyi","year":"2014","unstructured":"Hongyi Zeng , Shidong Zhang , Fei Ye , Vimalkumar Jeyakumar , Mickey Ju , Junda Liu , Nick McKeown , and Amin Vahdat . 2014 . Libra: Divide and conquer to verify forwarding tables in huge networks . In Proc. 11th USENIX Symposium on Networked Systems Design and Implementation (NSDI). USENIX Association, 87--99 . Hongyi Zeng, Shidong Zhang, Fei Ye, Vimalkumar Jeyakumar, Mickey Ju, Junda Liu, Nick McKeown, and Amin Vahdat. 2014. Libra: Divide and conquer to verify forwarding tables in huge networks. In Proc. 11th USENIX Symposium on Networked Systems Design and Implementation (NSDI). USENIX Association, 87--99."}],"event":{"name":"CoNEXT '18: The 14th International Conference on emerging Networking EXperiments and Technologies","location":"Heraklion Greece","acronym":"CoNEXT '18","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the 14th International Conference on emerging Networking EXperiments and Technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3281411.3281432","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3281411.3281432","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:18Z","timestamp":1750208238000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3281411.3281432"}},"subtitle":["fast verification of MPLS networks with multiple link failures"],"short-title":[],"issued":{"date-parts":[[2018,12,4]]},"references-count":27,"alternative-id":["10.1145\/3281411.3281432","10.1145\/3281411"],"URL":"https:\/\/doi.org\/10.1145\/3281411.3281432","relation":{},"subject":[],"published":{"date-parts":[[2018,12,4]]},"assertion":[{"value":"2018-12-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}