{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T12:15:18Z","timestamp":1725884118567},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319572871"},{"type":"electronic","value":"9783319572888"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-57288-8_27","type":"book-chapter","created":{"date-parts":[[2017,4,8]],"date-time":"2017-04-08T06:45:05Z","timestamp":1491633905000},"page":"373-388","source":"Crossref","is-referenced-by-count":4,"title":["Verifying a Class of Certifying Distributed Programs"],"prefix":"10.1007","author":[{"given":"Kim","family":"V\u00f6llinger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samira","family":"Akili","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,9]]},"reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-319-11764-5_2","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"L Blin","year":"2014","unstructured":"Blin, L., Fraigniaud, P., Patt-Shamir, B.: On proof-labeling schemes versus silent self-stabilizing algorithms. In: Felber, P., Garg, V. (eds.) SSS 2014. LNCS, vol. 8756, pp. 18\u201332. Springer, Cham (2014). doi: 10.1007\/978-3-319-11764-5_2"},{"key":"27_CR2","unstructured":"Claret, G.: Pluto: a first concurrent web server in Gallina. http:\/\/coq-blog.clarus.me\/pluto-a-first-concurrent-web-server-in-gallina.html"},{"key":"27_CR3","unstructured":"Duprat, J.: A coq toolkit for graph theory (2011). rapport de recherche. Ecole Normale Superieur de Lyon"},{"key":"27_CR4","unstructured":"INRIA: The coq proof assistant. http:\/\/coq.inria.fr\/"},{"issue":"4","key":"27_CR5","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s00446-010-0095-3","volume":"22","author":"A Korman","year":"2010","unstructured":"Korman, A., Kutten, S., Peleg, D.: Proof labeling schemes. Distrib. Comput. 22(4), 215\u2013233 (2010)","journal-title":"Distrib. Comput."},{"key":"27_CR6","volume-title":"Distributed Algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers Inc., San Francisco (1996)"},{"key":"27_CR7","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.cosrev.2010.09.009","volume":"5","author":"RM McConnell","year":"2011","unstructured":"McConnell, R.M., Mehlhorn, K., N\u00e4her, S., Schweitzer, P.: Certifying algorithms. Comput. Sci. Rev. 5, 119\u2013161 (2011)","journal-title":"Comput. Sci. Rev."},{"key":"27_CR8","volume-title":"LEDA: A Platform for Combinatorial and Geometric Computing","author":"K Mehlhorn","year":"1999","unstructured":"Mehlhorn, K., N\u00e4her, S.: LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999)"},{"key":"27_CR9","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing: A Locality-Sensitive Approach","author":"D Peleg","year":"2000","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. Society for Industrial and Applied Mathematics, Philadelphia (2000)"},{"key":"27_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-38123-2","volume-title":"Distributed Algorithms for Message-Passing Systems","author":"M Raynal","year":"2013","unstructured":"Raynal, M.: Distributed Algorithms for Message-Passing Systems. Springer, Heidelberg (2013)"},{"key":"27_CR11","unstructured":"Rizkallah, C.: Verification of program computations. Ph.D. thesis (2015)"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-319-22969-0_14","volume-title":"Software Engineering and Formal Methods","author":"K V\u00f6llinger","year":"2015","unstructured":"V\u00f6llinger, K., Reisig, W.: Certification of distributed algorithms solving problems with optimal substructure. In: Calinescu, R., Rumpe, B. (eds.) SEFM 2015. LNCS, vol. 9276, pp. 190\u2013195. Springer, Cham (2015). doi: 10.1007\/978-3-319-22969-0_14"},{"key":"27_CR13","unstructured":"Weitz, K., Woos, D., Torlak, E., Ernst, M.D., Krishnamurthy, A., Tatlock, Z.: Formal semantics and automated verification for the border gateway protocol. In: ACM SIGCOMM Workshop on Networking and Programming Languages (NetPL 2016), Florianopolis, Brazil (2016)"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-57288-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T14:29:21Z","timestamp":1498400961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-57288-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319572871","9783319572888"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57288-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}