{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:56:42Z","timestamp":1767139002478,"version":"build-2238731810"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319948201","type":"print"},{"value":"9783319948218","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94821-8_37","type":"book-chapter","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T13:25:55Z","timestamp":1530624355000},"page":"623-639","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Agda Formalization of \u00dcresin & Dubois\u2019 Asynchronous Fixed-Point Theory"],"prefix":"10.1007","author":[{"given":"Ran","family":"Zmigrod","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew L.","family":"Daggitt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timothy G.","family":"Griffin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,4]]},"reference":[{"key":"37_CR1","unstructured":"Agda routing library. https:\/\/github.com\/MatthewDaggitt\/agda-routing\/tree\/itp2018"},{"issue":"1","key":"37_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S00245ED1V01Y201001CNT003","volume":"3","author":"JS Baras","year":"2010","unstructured":"Baras, J.S., Theodorakopoulos, G.: Path problems in networks. Synth. Lect. Commun. Netw. 3(1), 1\u201377 (2010)","journal-title":"Synth. Lect. Commun. Netw."},{"key":"37_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-03359-9_6","volume-title":"Theorem Proving in Higher Order Logics","author":"A Bove","year":"2009","unstructured":"Bove, A., Dybjer, P., Norell, U.: A brief overview of Agda \u2013 a functional language with dependent types. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 73\u201378. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03359-9_6"},{"issue":"4","key":"37_CR4","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1145\/1151659.1159957","volume":"36","author":"CK Chau","year":"2006","unstructured":"Chau, C.K.: Policy-based routing with non-strict preferences. SIGCOMM Comput. Commun. Rev. 36(4), 387\u2013398 (2006)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Daggitt, M.L., Gurney, A.J.T., Griffin, T.G.: Asynchronous convergence of policy-rich distributed bellman-ford routing protocols. In: SIGCOMM Proceedings. ACM (2018, to appear)","DOI":"10.1145\/3230543.3230561"},{"issue":"1","key":"37_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0304-3975(02)00238-4","volume":"293","author":"B Ducourthial","year":"2003","unstructured":"Ducourthial, B., Tixeuil, S.: Self-stabilization with path algebra. Theor. Comput. Sci. 293(1), 219\u2013236 (2003). Max-Plus Algebras","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"37_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0167-6423(02)00096-5","volume":"48","author":"SA Edwards","year":"2003","unstructured":"Edwards, S.A., Lee, E.A.: The semantics and execution of a synchronous block-diagram language. Sci. Comput. Program. 48(1), 21\u201342 (2003)","journal-title":"Sci. Comput. Program."},{"issue":"3","key":"37_CR8","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF01407866","volume":"39","author":"MN Tarazi El","year":"1982","unstructured":"El Tarazi, M.N.: Some convergence results for asynchronous algorithms. Numer. Math. 39(3), 325\u2013340 (1982)","journal-title":"Numer. Math."},{"issue":"1","key":"37_CR9","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0377-0427(00)00409-X","volume":"123","author":"A Frommer","year":"2000","unstructured":"Frommer, A., Szyld, D.B.: On asynchronous iterations. J. Comput. Appl. Math. 123(1), 201\u2013216 (2000)","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"37_CR10","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1109\/90.993304","volume":"10","author":"TG Griffin","year":"2002","unstructured":"Griffin, T.G., Shepherd, F.B., Wilfong, G.: The stable paths problem and interdomain routing. IEEE\/ACM Trans. Network. 10(2), 232\u2013243 (2002)","journal-title":"IEEE\/ACM Trans. Network."},{"key":"37_CR11","unstructured":"Gurney, A.J.T.: Asynchronous iterations in ultrametric spaces. Technical report (2017). https:\/\/arxiv.org\/abs\/1701.07434"},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Hendrick, C.: Routing information protocol (RIP), RFC 1058 (1988)","DOI":"10.17487\/rfc1058"},{"key":"37_CR13","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.entcs.2009.10.026","volume":"255","author":"L Henrio","year":"2009","unstructured":"Henrio, L., Kamm\u00fcller, F.: Functional active objects: typing and formalisation. Electron. Notes Theor. Comput. Sci. 255, 83\u2013101 (2009). FOCLASA","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"1","key":"37_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.entcs.2010.07.004","volume":"264","author":"L Henrio","year":"2010","unstructured":"Henrio, L., Khan, M.U.: Asynchronous components with futures: semantics and proofs in Isabelle\/HOL. Electron. Notes Theor. Comput. Sci. 264(1), 35\u201353 (2010)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"37_CR15","unstructured":"Lee, H., Welch, J.L.: Applications of probabilistic quorums to iterative algorithms. In: Proceedings 21st International Conference on Distributed Computing Systems, pp. 21\u201328, April 2001"},{"issue":"3","key":"37_CR16","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s00446-004-0106-3","volume":"17","author":"H Lee","year":"2005","unstructured":"Lee, H., Welch, J.L.: Randomized registers and iterative algorithms. Distrib. Comput. 17(3), 209\u2013221 (2005)","journal-title":"Distrib. Comput."},{"key":"37_CR17","doi-asserted-by":"crossref","unstructured":"Meseguer, J., \u00d6lveczky, P.C.: Formalization and correctness of the PALS architectural pattern for distributed real-time systems. In: ICFEM, pp. 303\u2013320 (2010)","DOI":"10.1007\/978-3-642-16901-4_21"},{"key":"37_CR18","doi-asserted-by":"crossref","unstructured":"Rekhter, Y., Li, T.: A Border Gateway Protocol (BGP) (1995)","DOI":"10.17487\/rfc1771"},{"key":"37_CR19","first-page":"353","volume":"2","author":"E Sch\u00f6rner","year":"2003","unstructured":"Sch\u00f6rner, E.: Ultrametric fixed point theorems and applications. Valuat. Theory Appl. 2, 353\u2013359 (2003)","journal-title":"Valuat. Theory Appl."},{"issue":"5","key":"37_CR20","doi-asserted-by":"publisher","first-page":"1160","DOI":"10.1109\/TNET.2005.857111","volume":"13","author":"JL Sobrinho","year":"2005","unstructured":"Sobrinho, J.L.: An algebraic theory of dynamic network routing. IEEE\/ACM Trans. Netw. 13(5), 1160\u20131173 (2005)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"3","key":"37_CR21","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1145\/79147.79162","volume":"37","author":"A \u00dcresin","year":"1990","unstructured":"\u00dcresin, A., Dubois, M.: Parallel asynchronous algorithms for discrete data. J. ACM 37(3), 588\u2013606 (1990)","journal-title":"J. ACM"},{"issue":"1","key":"37_CR22","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1006\/jpdc.1996.0046","volume":"34","author":"A \u00dcresin","year":"1996","unstructured":"\u00dcresin, A., Dubois, M.: Effects of asynchronism on the convergence rate of iterative algorithms. J. Parallel Distrib. Comput. 34(1), 66\u201381 (1996)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"8","key":"37_CR23","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1016\/0167-8191(93)90072-S","volume":"19","author":"J Wei","year":"1993","unstructured":"Wei, J.: Parallel asynchronous iterations of least fixed points. Parallel Comput. 19(8), 887\u2013895 (1993)","journal-title":"Parallel Comput."}],"updated-by":[{"DOI":"10.1007\/978-3-319-94821-8_38","type":"erratum","label":"Erratum","source":"publisher","updated":{"date-parts":[[2018,9,12]],"date-time":"2018-09-12T00:00:00Z","timestamp":1536710400000}}],"container-title":["Lecture Notes in Computer Science","Interactive Theorem Proving"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94821-8_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,20]],"date-time":"2019-10-20T05:03:57Z","timestamp":1571547837000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-94821-8_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319948201","9783319948218"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94821-8_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ITP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Interactive Theorem Proving","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oxford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"itp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/itp2018.inria.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}