{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:12:52Z","timestamp":1760202772159},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030349912"},{"type":"electronic","value":"9783030349929"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-34992-9_6","type":"book-chapter","created":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T18:02:48Z","timestamp":1573754568000},"page":"69-83","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Tasks in Modular Proofs of Concurrent Algorithms"],"prefix":"10.1007","author":[{"given":"Armando","family":"Casta\u00f1eda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aur\u00e9lie","family":"Hurault","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Qu\u00e9innec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthieu","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,14]]},"reference":[{"key":"6_CR1","first-page":"117","volume":"3","author":"D Alistarh","year":"2015","unstructured":"Alistarh, D.: The renaming problem: recent developments and open questions. Bull. EATCS 3, 117 (2015)","journal-title":"Bull. EATCS"},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"251","DOI":"10.2298\/CSIS130122007A","volume":"11","author":"MB Andriamiarina","year":"2014","unstructured":"Andriamiarina, M.B., M\u00e9ry, D., Singh, N.K.: Revisiting snapshot algorithms by refinement-based techniques. Comput. Sci. Inf. Syst. 11(1), 251\u2013270 (2014)","journal-title":"Comput. Sci. Inf. Syst."},{"issue":"3","key":"6_CR3","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s00224-013-9448-1","volume":"55","author":"J Aspnes","year":"2014","unstructured":"Aspnes, J., Ellen, F.: Tight bounds for adopt-commit objects. Theory Comput. Syst. 55(3), 451\u2013474 (2014)","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"6_CR4","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., Reischuk, R.: Renaming in an asynchronous environment. J. ACM 37(3), 524\u2013548 (1990)","journal-title":"J. ACM"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP impossibility result for t-resilient asynchronous computations. In: STOC 1993: Proceedings of the ACM Symposium on Theory of computing, pp. 91\u2013100. ACM, New York (1993)","DOI":"10.1145\/167088.167119"},{"issue":"3","key":"6_CR6","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/PL00008933","volume":"14","author":"E Borowsky","year":"2001","unstructured":"Borowsky, E., Gafni, E., Lynch, N.A., Rajsbaum, S.: The BG distributed simulation algorithm. Distrib. Comput. 14(3), 127\u2013146 (2001)","journal-title":"Distrib. Comput."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Casta\u00f1eda, A., Hurault, A., Qu\u00e9innec, P., Roy, M.: Tasks in modular proofs of concurrent algorithms. CoRR, arXiv:1909.05537 [cs.DC] (2019)","DOI":"10.1007\/978-3-030-34992-9_6"},{"issue":"3","key":"6_CR8","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.cosrev.2011.04.001","volume":"5","author":"A Casta\u00f1eda","year":"2011","unstructured":"Casta\u00f1eda, A., Rajsbaum, S., Raynal, M.: The renaming problem in shared memory systems: an introduction. Comput. Sci. Rev. 5(3), 229\u2013251 (2011)","journal-title":"Comput. Sci. Rev."},{"issue":"6","key":"6_CR9","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/3266457","volume":"65","author":"A Casta\u00f1eda","year":"2018","unstructured":"Casta\u00f1eda, A., Rajsbaum, S., Raynal, M.: Unifying concurrent objects and distributed tasks: interval-linearizability. J. ACM 65(6), 45 (2018)","journal-title":"J. ACM"},{"issue":"1","key":"6_CR10","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1006\/inco.1993.1043","volume":"105","author":"S Chaudhuri","year":"1993","unstructured":"Chaudhuri, S.: More choices allow more faults: set consensus problems in totally asynchronous systems. Inf. Comput. 105(1), 132\u2013158 (1993)","journal-title":"Inf. Comput."},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1007\/978-3-642-31424-7_55","volume-title":"Computer Aided Verification","author":"S Conchon","year":"2012","unstructured":"Conchon, S., Goel, A., Krsti\u0107, S., Mebsout, A., Za\u00efdi, F.: Cubicle: a parallel SMT-based model checker for parameterized systems. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 718\u2013724. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31424-7_55"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-39799-8_11","volume-title":"Computer Aided Verification","author":"C Dr\u0103goi","year":"2013","unstructured":"Dr\u0103goi, C., Gupta, A., Henzinger, T.A.: Automatic linearizability proofs of concurrent objects with cooperating updates. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 174\u2013190. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_11"},{"key":"6_CR13","unstructured":"Gafni, E.: Round-by-round fault detectors: unifying synchrony and asynchrony (extended abstract). In: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, PODC 1998, pp. 143\u2013152 (1998)"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-642-14203-1_3","volume-title":"Automated Reasoning","author":"S Ghilardi","year":"2010","unstructured":"Ghilardi, S., Ranise, S.: MCMT: a model checker modulo theories. In: Giesl, J., H\u00e4hnle, R. (eds.) IJCAR 2010. LNCS (LNAI), vol. 6173, pp. 22\u201329. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14203-1_3"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"73","DOI":"10.4204\/EPTCS.277.6","volume":"277","author":"\u00c9ric Goubault","year":"2018","unstructured":"Goubault, \u00c9., Ledent, J., Rajsbaum, S.: A simplicial complex model for dynamic epistemic logic to study distributed task computability. In: Ninth International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2018, pp. 73\u201387 (2018)","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-662-48653-5_25","volume-title":"Distributed Computing","author":"N Hemed","year":"2015","unstructured":"Hemed, N., Rinetzky, N., Vafeiadis, V.: Modular verification of concurrency-aware linearizability. In: Moses, Y. (ed.) DISC 2015. LNCS, vol. 9363, pp. 371\u2013387. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48653-5_25"},{"issue":"1","key":"6_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jpdc.2009.08.011","volume":"70","author":"D Hendler","year":"2010","unstructured":"Hendler, D., Shavit, N., Yerushalmi, L.: A scalable lock-free stack algorithm. J. Parallel Distrib. Comput. 70(1), 1\u201312 (2010)","journal-title":"J. Parallel Distrib. Comput."},{"key":"6_CR18","volume-title":"Distributed Computing Through Combinatorial Topology","author":"M Herlihy","year":"2013","unstructured":"Herlihy, M., Kozlov, D.N., Rajsbaum, S.: Distributed Computing Through Combinatorial Topology. Morgan Kaufmann, Burlington (2013)"},{"key":"6_CR19","volume-title":"The Art of Multiprocessor Programming","author":"M Herlihy","year":"2008","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann, Burlington (2008)"},{"issue":"3","key":"6_CR20","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"6_CR21","volume-title":"The SPIN Model Checker - Primer and Reference Manual","author":"GJ Holzmann","year":"2004","unstructured":"Holzmann, G.J.: The SPIN Model Checker - Primer and Reference Manual. Addison-Wesley, Boston (2004)"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-030-31157-5_10","volume-title":"Tests and Proofs","author":"A Hurault","year":"2019","unstructured":"Hurault, A., Qu\u00e9innec, P.: Proving a non-blocking algorithm for process renaming with TLA$$^+$$. In: Beyer, D., Keller, C. (eds.) TAP 2019. LNCS, vol. 11823, pp. 147\u2013166. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31157-5_10"},{"key":"6_CR23","unstructured":"IEC: IEC-61508: Functional safety. https:\/\/www.iec.ch\/functionalsafety\/"},{"issue":"5","key":"6_CR24","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1145\/1506409.1506431","volume":"52","author":"WN Scherer III","year":"2009","unstructured":"Scherer III, W.N., Lea, D., Scott, M.L.: Scalable synchronous queues. Commun. ACM 52(5), 100\u2013111 (2009)","journal-title":"Commun. ACM"},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-540-30186-8_13","volume-title":"Distributed Computing","author":"WN Scherer","year":"2004","unstructured":"Scherer, W.N., Scott, M.L.: Nonblocking concurrent data structures with condition synchronization. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol. 3274, pp. 174\u2013187. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30186-8_13"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"John, A., Konnov, I., Schmid, U., Veith, H., Widder, J.: Parameterized model checking of fault-tolerant distributed algorithms by abstraction. In: Formal Methods in Computer-Aided Design, FMCAD 2013, pp. 201\u2013209. IEEE, October 2013","DOI":"10.1109\/FMCAD.2013.6679411"},{"key":"6_CR27","volume-title":"Specifying Systems","author":"L Lamport","year":"2002","unstructured":"Lamport, L.: Specifying Systems. Addison Wesley, Boston (2002)"},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-642-24100-0_22","volume-title":"Distributed Computing","author":"L Lamport","year":"2011","unstructured":"Lamport, L.: Byzantizing paxos by refinement. In: Peleg, D. (ed.) DISC 2011. LNCS, vol. 6950, pp. 211\u2013224. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24100-0_22"},{"key":"6_CR29","unstructured":"Lu, T.: Formal verification of the pastry protocol. Ph.D. thesis, Universit\u00e9 de Lorraine - Universit\u00e4t des Saarlandes, July 2013"},{"key":"6_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-21461-5_16","volume-title":"Formal Techniques for Distributed Systems","author":"T Lu","year":"2011","unstructured":"Lu, T., Merz, S., Weidenbach, C.: Towards verification of the pastry protocol using TLA$$^{+}$$. In: Bruni, R., Dingel, J. (eds.) FMOODS\/FORTE -2011. LNCS, vol. 6722, pp. 244\u2013258. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21461-5_16"},{"issue":"1","key":"6_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-6423(95)00009-H","volume":"25","author":"M Moir","year":"1995","unstructured":"Moir, M., Anderson, J.H.: Wait-free algorithms for fast, long-lived renaming. Sci. Comput. Program. 25(1), 1\u201339 (1995)","journal-title":"Sci. Comput. Program."},{"key":"6_CR32","doi-asserted-by":"crossref","unstructured":"Moir, M., Nussbaum, D., Shalev, O., Shavit, N.: Using elimination to implement scalable and lock-free FIFO queues. In: 17th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2005, pp. 253\u2013262. ACM (2005)","DOI":"10.1145\/1073970.1074013"},{"key":"6_CR33","doi-asserted-by":"crossref","unstructured":"Neiger, G.: Set-linearizability. In: Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, Los Angeles, California, USA, 14\u201317 August 1994, p. 396 (1994)","DOI":"10.1145\/197917.198176"},{"key":"6_CR34","doi-asserted-by":"crossref","unstructured":"O\u2019Hearn, P.W., Rinetzky, N., Vechev, M.T., Yahav, E., Yorsh, G.: Verifying linearizability with hindsight. In: 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, pp. 85\u201394. ACM (2010)","DOI":"10.1145\/1835698.1835722"},{"key":"6_CR35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32027-9","volume-title":"Concurrent Programming - Algorithms, Principles, and Foundations","author":"M Raynal","year":"2013","unstructured":"Raynal, M.: Concurrent Programming - Algorithms, Principles, and Foundations. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-32027-9"},{"issue":"6","key":"6_CR36","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/s002240000072","volume":"30","author":"N Shavit","year":"1997","unstructured":"Shavit, N., Touitou, D.: Elimination trees and the construction of pools and stacks. Theory Comput. Syst. 30(6), 645\u2013670 (1997)","journal-title":"Theory Comput. Syst."},{"key":"6_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-319-10181-1_22","volume-title":"Integrated Formal Methods","author":"B Tofan","year":"2014","unstructured":"Tofan, B., Schellhorn, G., Reif, W.: A compositional proof method for linearizability applied to a wait-free multiset. In: Albert, E., Sekerinski, E. (eds.) IFM 2014. LNCS, vol. 8739, pp. 357\u2013372. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10181-1_22"},{"issue":"2","key":"6_CR38","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/2185376.2185383","volume":"42","author":"P Zave","year":"2012","unstructured":"Zave, P.: Using lightweight modeling to understand Chord. SIGCOMM Comput. Commun. Rev. 42(2), 49\u201357 (2012)","journal-title":"SIGCOMM Comput. Commun. Rev."}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34992-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,12]],"date-time":"2019-12-12T05:26:14Z","timestamp":1576128374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34992-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030349912","9783030349929"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34992-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pisa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sss2019.lip6.fr\/symp\/sss2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}