{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:14:37Z","timestamp":1729653277559,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1109\/inm.2015.7140296","type":"proceedings-article","created":{"date-parts":[[2015,7,6]],"date-time":"2015-07-06T21:19:27Z","timestamp":1436217567000},"page":"225-233","source":"Crossref","is-referenced-by-count":6,"title":["A fast method of verifying network routing with back-trace header space analysis"],"prefix":"10.1109","author":[{"given":"Toshio","family":"Tonouchi","sequence":"first","affiliation":[]},{"given":"Satoshi","family":"Yamazaki","sequence":"additional","affiliation":[]},{"given":"Yutaka","family":"Yakuwa","sequence":"additional","affiliation":[]},{"given":"Nobuyuki","family":"Tomizawa","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"article-title":"STP Constraint Solver","year":"0","author":"ganesh","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ANZIIS.1994.396988"},{"year":"0","key":"ref12","article-title":"Trema: Full-Stack OpenFlow Framework in Ruby and C"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2009.5339690"},{"key":"ref14","first-page":"127","article-title":"A nice way to test openflow applications","author":"canini","year":"2012","journal-title":"Proceedings of the 9th USENIX Conference on Networked Systems Design and Implementation NSDI'12"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1145\/2043164.2018470","article-title":"Debugging the Data Plane with Anteater","volume":"41","author":"haohui","year":"2011","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"ref3","article-title":"Constructing Optimal IP Routing Tables","author":"richard","year":"1998","journal-title":"Microsoft Technical Report (MSR-T R-98-59)"},{"article-title":"DNA Pairing: Using Differential Network Analysis to find Reachability Bugs","year":"2014","author":"lopes","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2013.6654813"},{"key":"ref8","first-page":"99","article-title":"Real time network policy checking using header space analysis","author":"kazemian","year":"2013","journal-title":"Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2377677.2377766"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1866898.1866905"},{"key":"ref1","article-title":"Header space analysis: static checking for networks","author":"kazemian","year":"0","journal-title":"Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation (NSDI'12) USENIX Association"},{"article-title":"Network Verification in the Light of Program Verification","year":"2013","author":"lopes","key":"ref9"}],"event":{"name":"2015 IFIP\/IEEE International Symposium on Integrated Network Management (IM)","start":{"date-parts":[[2015,5,11]]},"location":"Ottawa, ON, Canada","end":{"date-parts":[[2015,5,15]]}},"container-title":["2015 IFIP\/IEEE International Symposium on Integrated Network Management (IM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7121095\/7140257\/07140296.pdf?arnumber=7140296","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T15:12:13Z","timestamp":1498230733000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7140296\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/inm.2015.7140296","relation":{},"subject":[],"published":{"date-parts":[[2015,5]]}}}