{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T11:36:28Z","timestamp":1770896188820,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642240997","type":"print"},{"value":"9783642241000","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-24100-0_34","type":"book-chapter","created":{"date-parts":[[2011,10,19]],"date-time":"2011-10-19T02:20:40Z","timestamp":1318990840000},"page":"333-347","source":"Crossref","is-referenced-by-count":11,"title":["Locality and Checkability in Wait-Free Computing"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Fraigniaud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Rajsbaum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Corentin","family":"Travers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Local and Global Properties in Networks of Processors (Extended Abstract). In: 12th ACM Symp. on Theory of Computing (STOC), pp. 82\u201393 (1980)","DOI":"10.1145\/800141.804655"},{"issue":"3","key":"34_CR2","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1145\/79147.79158","volume":"37","author":"H. Attiya","year":"1990","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuck, R.: Renaming in Asynchronous Environment. Journal of the ACM\u00a037(3), 524\u2013548 (1990)","journal-title":"Journal of the ACM"},{"key":"34_CR3","doi-asserted-by":"publisher","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing: Fundamentals, Simulations, and Advanced Topics","author":"H. Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations, and Advanced Topics. Wiley, Chichester (2004)"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Patt-Shamir, B., Varghese, G.: Self-stabilization by Local Checking and Correction. In: 32nd IEEE Symp. on Foundations of Computer Science (FOCS), pp. 268\u2013277 (1991)","DOI":"10.1109\/SFCS.1991.185378"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Varghese, G.: Distributed Program Checking: a Paradigm for Building Self-stabilizing Distributed Protocols. In: 32nd IEEE Symp. on Foundations of Computer Science (FOCS), pp. 258\u2013267 (1991)","DOI":"10.1109\/SFCS.1991.185377"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Barenboim, L., Elkin, M.: Deterministic distributed vertex coloring in polylogarithmic time. In: 29th ACM Symp. on Principles of Distributed Computing (PODC), pp. 410\u2013419 (2010)","DOI":"10.1145\/1835698.1835797"},{"issue":"1","key":"34_CR7","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1145\/200836.200880","volume":"42","author":"M. Blum","year":"1995","unstructured":"Blum, M., Kannan, S.: Designing Programs that Check Their Work. J. ACM\u00a042(1), 269\u2013291 (1995)","journal-title":"J. ACM"},{"issue":"3","key":"34_CR8","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/0022-0000(93)90044-W","volume":"47","author":"M. Blum","year":"1993","unstructured":"Blum, M., Luby, M., Rubinfeld, R.: Self-Testing\/Correcting with Applications to Numerical Problems. J. Comput. Syst. Sci.\u00a047(3), 549\u2013595 (1993)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"34_CR9","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s00446-010-0115-3","volume":"23","author":"J. Chalopin","year":"2010","unstructured":"Chalopin, J., M\u00e9tivier, Y.: On the Power of Synchronization Between two Adjacent Processes. Distributed Computing\u00a023(3), 177\u2013196 (2010)","journal-title":"Distributed Computing"},{"issue":"1","key":"34_CR10","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/S0019-9958(86)80023-7","volume":"70","author":"R. Cole","year":"1986","unstructured":"Cole, R., Vishkin, U.: Deterministic coin tossing with applications to optimal parallel list ranking. Information and Control\u00a070(1), 32\u201353 (1986)","journal-title":"Information and Control"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Das Sarma, A., Holzer, S., Kor, L., Korman, A., Nanongkai, D., Pandurangan, G., Peleg, D., Wattenhofer, R.: Distributed Verification and Hardness of Distributed Approximation. In: 43rd ACM Symp. on Theory of Computing, STOC (2011)","DOI":"10.1145\/1993636.1993686"},{"issue":"3","key":"34_CR12","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/5925.5931","volume":"33","author":"D. Dolev","year":"1986","unstructured":"Dolev, D., Lynch, N., Pinter, S., Stark, E., Weihl, W.: Reaching Approximate Agreement in the Presence of Faults. J. ACM\u00a033(3), 499\u2013516 (1986)","journal-title":"J. ACM"},{"issue":"3","key":"34_CR13","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1006\/jcss.1999.1692","volume":"60","author":"F. Erg\u00fcn","year":"2000","unstructured":"Erg\u00fcn, F., Kannan, S., Kumar, R., Rubinfeld, R., Viswanathan, M.: Spot-Checkers. J. Comput. Syst. Sci.\u00a060(3), 717\u2013751 (2000)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"34_CR14","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M. Fischer","year":"1985","unstructured":"Fischer, M., Lynch, N., Paterson, M.: Impossibility of Distributed Consensus with One Faulty Process. J. ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"issue":"3-4","key":"34_CR15","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.jcss.2009.07.002","volume":"76","author":"P. Fraigniaud","year":"2010","unstructured":"Fraigniaud, P., Ilcinkas, D., Pelc, A.: Communication algorithms with advice. J. Comput. Syst. Sci.\u00a076(3-4), 222\u2013232 (2010)","journal-title":"J. Comput. Syst. Sci."},{"key":"34_CR16","unstructured":"Fraigniaud, P., Korman, A., Peleg, D.: Local Distributed Decision. arXiv:1011.2152"},{"key":"34_CR17","unstructured":"Fraigniaud, P., Rajsbaum, S., Travers, C.: Locality and Checkability in Wait-free Computing. technical report, http:\/\/hal.archives-ouvertes.fr\/hal-00605244\/en\/"},{"key":"34_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/3-540-48169-9_19","volume-title":"Distributed Computing","author":"M. Franklin","year":"1999","unstructured":"Franklin, M., Garay, J.A., Yung, M.: Self-Testing\/Correcting Protocols. In: Jayanti, P. (ed.) DISC 1999. LNCS, vol.\u00a01693, pp. 269\u2013284. Springer, Heidelberg (1999)"},{"issue":"1","key":"34_CR19","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1006\/inco.1997.2648","volume":"138","author":"Y. Freund","year":"1997","unstructured":"Freund, Y., Kearns, M., Ron, D., Rubinfeld, R., Schapire, R., Sellie, L.: Efficient Learning of Typical Finite Automata from Random Walks. Inf. Comput.\u00a0138(1), 23\u201348 (1997)","journal-title":"Inf. Comput."},{"issue":"3","key":"34_CR20","doi-asserted-by":"publisher","first-page":"970","DOI":"10.1137\/S0097539796305766","volume":"28","author":"E. Gafni","year":"1999","unstructured":"Gafni, E., Koutsoupias, E.: Three-Processor Tasks Are Undecidable. SIAM J. Comput.\u00a028(3), 970\u2013983 (1999)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"34_CR21","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1145\/285055.285060","volume":"45","author":"O. Goldreich","year":"1998","unstructured":"Goldreich, O., Goldwasser, S., Shari, Ron, D.: Property Testing and its Connection to Learning and Approximation. J. ACM\u00a045(4), 653\u2013750 (1998)","journal-title":"J. ACM"},{"key":"34_CR22","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Gutfreund, D., Healy, A., Kaufman, T., Rothblum, G.: A (De)constructive Approach to Program Checking. In: 40th ACM Symp. on Theory of Computing (STOC), pp. 143\u2013152 (2008)","DOI":"10.1145\/1374376.1374399"},{"key":"34_CR23","doi-asserted-by":"crossref","unstructured":"Goos, M., Suomela, J.: Locally checkable proofs. In: 30th ACM Symp. on Principles of Distributed Computing, PODC (2011)","DOI":"10.1145\/1993806.1993829"},{"key":"34_CR24","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Rajsbaum, S.: The Decidability of Distributed Decision Tasks. In: 29th ACM Symp. on the Theory of Computing (STOC), pp. 589\u2013598 (1997)","DOI":"10.1145\/258533.258652"},{"issue":"1","key":"34_CR25","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0304-3975(01)00396-6","volume":"291","author":"M. Herlihy","year":"2003","unstructured":"Herlihy, M., Rajsbaum, S.: A Classification of Wait-Free Loop Agreement Tasks. Theor. Comput. Sci.\u00a0291(1), 55\u201377 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"34_CR26","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"M. Herlihy","year":"1999","unstructured":"Herlihy, M., Shavit, N.: The Topological Structure of Asynchronous Computability. J. ACM\u00a046(6), 858\u2013923 (1999)","journal-title":"J. ACM"},{"key":"34_CR27","doi-asserted-by":"publisher","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. Distributed Computing\u00a022, 215\u2013233 (2010)","journal-title":"Distributed Computing"},{"key":"34_CR28","doi-asserted-by":"crossref","unstructured":"Korman, A., Sereni, J.-S., Viennot, L.: Toward more Localized Local Algorithms: Removing Assumptions concerning Global Knowledge. In: 30th ACM Symp. on Principles of Distributed Computing, PODC (2011)","DOI":"10.1145\/1993806.1993814"},{"key":"34_CR29","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Wattenhofer, R.: On the complexity of distributed graph coloring. In: 25th ACM Symp. on Principles of Distributed Computing (PODC), pp. 7\u201315 (2006)","DOI":"10.1145\/1146381.1146387"},{"issue":"1","key":"34_CR30","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N. Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph algorithms. SIAM J. Comput.\u00a021(1), 193\u2013201 (1992)","journal-title":"SIAM J. Comput."},{"key":"34_CR31","doi-asserted-by":"crossref","unstructured":"Lipton, R.: New Directions in Testing. In: DIMACS Workshop on Distributed computing and Cryptography, vol.\u00a02, pp. 191\u2013202 (1991)","DOI":"10.1090\/dimacs\/002\/13"},{"key":"34_CR32","volume-title":"Distributed Algorithms","author":"N. Lynch","year":"1996","unstructured":"Lynch, N.: Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco (1996)"},{"key":"34_CR33","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0020-0190(97)00022-7","volume":"61","author":"A. Mazurkiewicz","year":"1997","unstructured":"Mazurkiewicz, A.: Distributed Enumeration. Inf. Process. Lett.\u00a061, 233\u2013239 (1997)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"34_CR34","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1137\/S0097539793254571","volume":"24","author":"M. Naor","year":"1995","unstructured":"Naor, M., Stockmeyer, L.: What can be Computed Locally? SIAM J. Comput.\u00a024(6), 1259\u20131277 (1995)","journal-title":"SIAM J. Comput."},{"key":"34_CR35","doi-asserted-by":"publisher","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. SIAM, Philadelphia (2000)"},{"issue":"4","key":"34_CR36","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1216\/RMJ-1973-3-4-641","volume":"3","author":"J. Rotman","year":"1973","unstructured":"Rotman, J.: Covering Complexes with Applications to Algebra. Rocky Mountain J. of Mathematics\u00a03(4), 641\u2013674 (1973)","journal-title":"Rocky Mountain J. of Mathematics"},{"issue":"4","key":"34_CR37","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BF01961540","volume":"15","author":"R. Rubinfeld","year":"1996","unstructured":"Rubinfeld, R.: Designing Checkers for Programs that Run in Parallel. Algorithmica\u00a015(4), 287\u2013301 (1996)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24100-0_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T22:47:44Z","timestamp":1560811664000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24100-0_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642240997","9783642241000"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24100-0_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}