{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T09:04:01Z","timestamp":1768295041045,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642287558","type":"print"},{"value":"9783642287565","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28756-5_20","type":"book-chapter","created":{"date-parts":[[2012,3,22]],"date-time":"2012-03-22T16:57:15Z","timestamp":1332435435000},"page":"283-298","source":"Crossref","is-referenced-by-count":10,"title":["Reduction-Based Formal Analysis of BGP Instances"],"prefix":"10.1007","author":[{"given":"Anduo","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carolyn","family":"Talcott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander J. T.","family":"Gurney","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boon Thau","family":"Loo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andre","family":"Scedrov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"All About Maude - A High-Performance Logical Framework","author":"M. Clavel","year":"2007","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Talcott, C.: All About Maude - A High-Performance Logical Framework. LNCS, vol.\u00a04350. Springer, Heidelberg (2007)"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Feamster, N., Johari, R., Balakrishnan, H.: Implications of autonomy for the expressiveness of policy routing. In: ACM SIGCOMM (2005)","DOI":"10.1145\/1080091.1080096"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Feldmann, A., Maennel, O., Mao, Z.M., Berger, A., Maggs, B.: Locating Internet routing instabilities. In: ACM SIGCOMM (2004)","DOI":"10.1145\/1015467.1015491"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Flavel, A., Roughan, M., Bean, N., Shaikh, A.: Where\u2019s Waldo? Practical Searches for Stability in iBGP. In: Proc. International Conference on Network Protocols, ICNP (October 2008)","DOI":"10.1109\/ICNP.2008.4697049"},{"key":"20_CR5","unstructured":"Gao, L., Griffin, T.G., Rexford, J.: Inherently safe backup routing with BGP. In: IEEE INFOCOM (2001)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Gao, L., Rexford, J.: Stable Internet routing without global coordination. In: ACM SIGMETRICS (2000)","DOI":"10.1145\/339331.339426"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Griffin, T.G.: The stratified shortest-paths problem. In: COMSNETS (2010)","DOI":"10.1109\/COMSNETS.2010.5432000"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Griffin, T.G., Jaggard, A., Ramachandran, V.: Design principles of policy languages for path vector protocols. In: ACM SIGCOMM (2003)","DOI":"10.21236\/ADA461910"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1109\/90.993304","volume":"10","author":"T.G. Griffin","year":"2002","unstructured":"Griffin, T.G., Shepherd, F.B., Wilfong, G.: The stable paths problem and interdomain routing. IEEE Trans. on Networking\u00a010, 232\u2013243 (2002)","journal-title":"IEEE Trans. on Networking"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Griffin, T.G., Wilfong, G.: An analysis of BGP convergence properties. In: SIGCOMM (1999)","DOI":"10.1145\/316188.316231"},{"key":"20_CR11","unstructured":"Haeberlen, A., Avramopoulos, I., Rexford, J., Druschel, P.: NetReview: Detecting when interdomain routing goes wrong. In: NSDI (2009)"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Labovitz, C., Malan, G.R., Jahanian, F.: Internet Routing Instability. TON (1998)","DOI":"10.1145\/263105.263151"},{"issue":"1","key":"20_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J. Meseguer","year":"1992","unstructured":"Meseguer, J.: Conditional Rewriting Logic as a Unified Model of Concurrency. Theoretical Computer Science\u00a096(1), 73\u2013155 (1992)","journal-title":"Theoretical Computer Science"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Schapira, M., Zhu, Y., Rexford, J.: Putting BGP on the right path: A case for next-hop routing. In: ACM SIGCOMM HotNets (October 2010)","DOI":"10.1145\/1868447.1868450"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Sobrinho, J.: Network routing with path vector protocols: theory and applications. In: SIGCOMM (2003)","DOI":"10.1145\/863961.863963"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Vutukuru, M., Valiant, P., Kopparty, S., Balakrishnan, H.: How to Construct a Correct and Scalable iBGP Configuration. In: IEEE INFOCOM, Barcelona, Spain (April 2006)","DOI":"10.1109\/INFOCOM.2006.122"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Wang, A., Talcott, C., Gurney, A.J.T., Loo, B.T., Scedrov, A.: Reduction-based formal analysis of BGP instances. University of Pennsylvania Department of Computer and Information Science Technical Report (2012), \n                    \n                      http:\/\/netdb.cis.upenn.edu\/papers\/tacas12-TR.pdf","DOI":"10.1007\/978-3-642-28756-5_20"},{"key":"20_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-642-21461-5_22","volume-title":"Formal Techniques for Distributed Systems","author":"A. Wang","year":"2011","unstructured":"Wang, A., Talcott, C., Jia, L., Loo, B.T., Scedrov, A.: Analyzing BGP Instances in Maude. In: Bruni, R., Dingel, J. (eds.) FORTE 2011 and FMOODS 2011. LNCS, vol.\u00a06722, pp. 334\u2013348. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28756-5_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:08:49Z","timestamp":1620112129000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28756-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642287558","9783642287565"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28756-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}