{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T08:38:03Z","timestamp":1768293483264,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642214608","type":"print"},{"value":"9783642214615","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21461-5_22","type":"book-chapter","created":{"date-parts":[[2011,6,10]],"date-time":"2011-06-10T13:25:36Z","timestamp":1307712336000},"page":"334-348","source":"Crossref","is-referenced-by-count":9,"title":["Analyzing BGP Instances in Maude"],"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":"Limin","family":"Jia","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":"22_CR1","unstructured":"Alloy, http:\/\/alloy.mit.edu\/community\/"},{"key":"22_CR2","unstructured":"Arye, M., Harrison, R., Wang, R.: The Next 10,000 BGP Gadgets: Lightweight Modeling for the Stable Paths Problem. Princeton COS598D course project report"},{"issue":"4","key":"22_CR3","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/581771.581775","volume":"49","author":"K. Bhargavan","year":"2002","unstructured":"Bhargavan, K., Obradovic, D., Gunter, C.A.: Formal verification of standards for distance vector routing protocols. J. ACM\u00a049(4), 538\u2013576 (2002)","journal-title":"J. ACM"},{"key":"22_CR4","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. Springer, Heidelberg (2007)"},{"key":"22_CR5","unstructured":"Denker, G., Meseguer, J., Talcott, C.: Formal specification and analysis of active networks and communication protocols: The maude experience. DARPA Information Survivability Conference and Exposition (2000)"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Feamster, N., Johari, R., Balakrishnan, H.: Implications of Autonomy for the Expressiveness of Policy Routing. In: ACM SIGCOMM, Philadelphia, PA (August 2005)","DOI":"10.1145\/1080091.1080096"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Flavel, A., Roughan, M.: Stable and flexible iBGP. In: ACM SIGCOMM (2009)","DOI":"10.1145\/1592568.1592591"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Gao, L., Rexford, J.: Stable internet routing without global coordination. In: SIGMETRICS (2000)","DOI":"10.1145\/339331.339426"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Goodloe, A., Gunter, C.A., Stehr, M.-O.: Formal prototyping in early stages of protocol design. In: Proc. ACM WITS 2005 (2005)","DOI":"10.1145\/1045405.1045413"},{"key":"22_CR10","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":"22_CR11","doi-asserted-by":"crossref","unstructured":"Labovitz, C., Malan, G.R., Jahanian, F.: Internet Routing Instability. TON (1998)","DOI":"10.1145\/263105.263151"},{"key":"22_CR12","unstructured":"Maude, http:\/\/maude.cs.uiuc.edu\/"},{"issue":"1","key":"22_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":"22_CR14","doi-asserted-by":"crossref","unstructured":"\u00d6lveczky, P.C., Meseguer, J.: Real-time maude: A tool for simulating and analyzing real-time and hybrid systems. Electr. Notes Theor. Comput. Sci.\u00a036 (2000)","DOI":"10.1016\/S1571-0661(05)80134-3"},{"key":"22_CR15","unstructured":"PVS Specification and Verification System, http:\/\/pvs.csl.sri.com\/"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Schapira, M., Zhu, Y., Rexford, J.: Putting BGP on the right path: A case for next-hop routing. In: HotNets (October 2010)","DOI":"10.1145\/1868447.1868450"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Spring, N., Mahajan, R., Wetherall, D.: Measuring ISP topologies with Rocketfuel. In: SIGCOMM 2002 (2002)","DOI":"10.1145\/633025.633039"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Subramanian, L., Caesar, M., Ee, C.T., Handley, M., Mao, M., Shenker, S., Stoica, I.: HLP: A Next-generation Interdomain Routing Protocol. In: SIGCOMM (2005)","DOI":"10.1145\/1080091.1080095"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Wang, A., Talcott, C., Jia, L., Loo, B.T., Scedrov, A.: Analyzing BGP instances in maude. University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-11-08 (2011), http:\/\/netdb.cis.upenn.edu\/papers\/bgpMaudeTR.pdf","DOI":"10.1007\/978-3-642-21461-5_22"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21461-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,24]],"date-time":"2021-11-24T23:13:20Z","timestamp":1637795600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21461-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214608","9783642214615"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21461-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}