{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:18:24Z","timestamp":1743034704952,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319926117"},{"type":"electronic","value":"9783319926124"}],"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-92612-4_9","type":"book-chapter","created":{"date-parts":[[2018,5,29]],"date-time":"2018-05-29T04:35:20Z","timestamp":1527568520000},"page":"161-180","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On a Verification Framework for Certifying Distributed Algorithms: Distributed Checking and Consistency"],"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":[[2018,5,30]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-22110-1_7","volume-title":"Computer Aided Verification","author":"E Alkassar","year":"2011","unstructured":"Alkassar, E., B\u00f6hme, S., Mehlhorn, K., Rizkallah, C.: Verification of certifying computations. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 67\u201382. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_7"},{"issue":"3","key":"9_CR2","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s10817-013-9289-2","volume":"52","author":"E Alkassar","year":"2014","unstructured":"Alkassar, E., B\u00f6hme, S., Mehlhorn, K., Rizkallah, C.: A framework for the verification of certifying computations. J. Autom. Reason. 52(3), 241\u2013273 (2014)","journal-title":"J. Autom. Reason."},{"key":"9_CR3","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.entcs.2004.01.035","volume":"113","author":"K Arkoudas","year":"2005","unstructured":"Arkoudas, K., Rinard, M.C.: Deductive runtime certification. Electron. Notes Theor. Comput. Sci. 113, 45\u201363 (2005)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1007\/978-3-642-10631-6_61","volume-title":"Algorithms and Computation","author":"D Bruce","year":"2009","unstructured":"Bruce, D., Ho\u00e0ng, C.T., Sawada, J.: A certifying algorithm for 3-colorability of P$$^{5}$$-free graphs. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 594\u2013604. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10631-6_61"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-662-53426-7_4","volume-title":"Distributed Computing","author":"K Censor-Hillel","year":"2016","unstructured":"Censor-Hillel, K., Fischer, E., Schwartzman, G., Vasudev, Y.: Fast distributed algorithms for testing graph properties. In: Gavoille, C., Ilcinkas, D. (eds.) DISC 2016. LNCS, vol. 9888, pp. 43\u201356. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53426-7_4"},{"issue":"3","key":"9_CR6","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1137\/11083856X","volume":"42","author":"DG Corneil","year":"2013","unstructured":"Corneil, D.G., Dalton, B., Habib, M.: LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs. SIAM J. Comput. 42(3), 792\u2013807 (2013)","journal-title":"SIAM J. Comput."},{"key":"9_CR7","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6156.001.0001","volume-title":"Self-Stabilization","author":"S Dolev","year":"2000","unstructured":"Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)"},{"key":"9_CR8","unstructured":"Duprat, J.: A Coq toolkit for graph theory. Rapport de recherche 15 (2001)"},{"key":"9_CR9","unstructured":"Finkler, U., Mehlhorn, K.: Checking priority queues. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1999, pp. 901\u2013902. Society for Industrial and Applied Mathematics, Philadelphia (1999)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1007\/978-3-540-45236-2_41","volume-title":"FME 2003: Formal Methods","author":"S Glesner","year":"2003","unstructured":"Glesner, S.: Program checking with certificates: separating correctness-critical code. In: Araki, K., Gnesi, S., Mandrioli, D. (eds.) FME 2003. LNCS, vol. 2805, pp. 758\u2013777. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45236-2_41"},{"issue":"1","key":"9_CR11","first-page":"87","volume":"14","author":"P Heggernes","year":"2007","unstructured":"Heggernes, P., Kratsch, D.: Linear-time certifying recognition algorithms and forbidden induced subgraphs. Nord. J. Comput. 14(1), 87\u2013108 (2007)","journal-title":"Nord. J. Comput."},{"key":"9_CR12","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1137\/S0895480103430259","volume":"18","author":"P Hell","year":"2004","unstructured":"Hell, P., Huang, J.: Certifying LexBFS recognition algorithms for proper interval graphs and proper interval bigraphs. SIAM J. Disc. Math. 18, 554\u2013570 (2004)","journal-title":"SIAM J. Disc. Math."},{"issue":"39","key":"9_CR13","doi-asserted-by":"crossref","first-page":"5351","DOI":"10.1016\/j.tcs.2011.06.009","volume":"412","author":"RW Hung","year":"2011","unstructured":"Hung, R.W., Chang, M.S.: An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs. Theoret. Comput. Sci. 412(39), 5351\u20135373 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR14","unstructured":"INRIA: The Coq Proof Assistant. http:\/\/coq.inria.fr\/"},{"issue":"15","key":"9_CR15","doi-asserted-by":"crossref","first-page":"3216","DOI":"10.1016\/j.dam.2009.07.002","volume":"157","author":"H Kaplan","year":"2009","unstructured":"Kaplan, H., Nussbaum, Y.: Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs. Disc. Appl. Math. 157(15), 3216\u20133230 (2009)","journal-title":"Disc. Appl. Math."},{"issue":"4","key":"9_CR16","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":"9_CR17","volume-title":"Distributed Algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers Inc., San Francisco (1996)"},{"key":"9_CR18","unstructured":"McConnell, R.M.: A certifying algorithm for the consecutive-ones property. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, pp. 768\u2013777. Society for Industrial and Applied Mathematics, Philadelphia (2004)"},{"key":"9_CR19","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":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/BFb0055759","volume-title":"Mathematical Foundations of Computer Science 1998","author":"K Mehlhorn","year":"1998","unstructured":"Mehlhorn, K., N\u00e4her, S.: From algorithms to working programs: on the use of program checking in LEDA. In: Brim, L., Gruska, J., Zlatu\u0161ka, J. (eds.) MFCS 1998. LNCS, vol. 1450, pp. 84\u201393. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055759"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Mostafa, M., Bonakdarpour, B.: Decentralized runtime verification of LTL specifications in distributed systems. In: Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2015, pp. 494\u2013503. IEEE Computer Society, Washington, DC (2015)","DOI":"10.1109\/IPDPS.2015.95"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Necula, G.C., Lee, P.: The Design and implementation of a certifying compiler. In: Proceedings of the ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation, PLDI 1998, pp. 333\u2013344. ACM, New York (1998)","DOI":"10.1145\/277650.277752"},{"key":"9_CR23","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.tcs.2012.06.006","volume":"452","author":"SD Nikolopoulos","year":"2012","unstructured":"Nikolopoulos, S.D., Palios, L.: An O(nm)-time certifying algorithm for recognizing HHD-free graphs. Theor. Comput. Sci. 452, 117\u2013131 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-319-06200-6_4","volume-title":"NASA Formal Methods","author":"L Noschinski","year":"2014","unstructured":"Noschinski, L., Rizkallah, C., Mehlhorn, K.: Verification of certifying computations through autocorres and simpl. In: Badger, J.M., Rozier, K.Y. (eds.) NFM 2014. LNCS, vol. 8430, pp. 46\u201361. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06200-6_4"},{"key":"9_CR25","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/978-3-642-38123-2"},{"key":"9_CR26","unstructured":"Rizkallah, C.: Verification of program computations. Ph.D. thesis (2015)"},{"key":"9_CR27","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/s00453-010-9450-9","volume":"62","author":"JM Schmidt","year":"2012","unstructured":"Schmidt, J.M.: Construction sequences and certifying 3-connectivity. Algorithmica 62, 192\u2013208 (2012)","journal-title":"Algorithmica"},{"key":"9_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-319-67531-2_29","volume-title":"Runtime Verification","author":"K V\u00f6llinger","year":"2017","unstructured":"V\u00f6llinger, K.: Verifying the output of a distributed algorithm using certification. In: Lahiri, S., Reger, G. (eds.) RV 2017. LNCS, vol. 10548, pp. 424\u2013430. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67531-2_29"},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-319-57288-8_27","volume-title":"NASA Formal Methods","author":"K V\u00f6llinger","year":"2017","unstructured":"V\u00f6llinger, K., Akili, S.: Verifying a class of certifying distributed programs. In: Barrett, C., Davies, M., Kahsai, T. (eds.) NFM 2017. LNCS, vol. 10227, pp. 373\u2013388. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57288-8_27"},{"key":"9_CR30","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). https:\/\/doi.org\/10.1007\/978-3-319-22969-0_14"},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"Wilcox, J.R., Woos, D., Panchekha, P., Tatlock, Z., Wang, X., Ernst, M.D., Anderson, T.: Verdi: a framework for implementing and formally verifying distributed systems. In: ACM SIGPLAN Notices, vol. 50, pp. 357\u2013368. ACM (2015)","DOI":"10.1145\/2737924.2737958"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Objects, Components, and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-92612-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,18]],"date-time":"2019-10-18T15:04:16Z","timestamp":1571411056000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-92612-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319926117","9783319926124"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-92612-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"FORTE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Techniques for Distributed Objects, Components, and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"18 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"38","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"forte2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2018.discotec.org\/cfp_forte.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}