{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:46:35Z","timestamp":1742971595827,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":23,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819606016"},{"type":"electronic","value":"9789819606023"}],"license":[{"start":{"date-parts":[[2024,11,25]],"date-time":"2024-11-25T00:00:00Z","timestamp":1732492800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,25]],"date-time":"2024-11-25T00:00:00Z","timestamp":1732492800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-0602-3_13","type":"book-chapter","created":{"date-parts":[[2024,11,24]],"date-time":"2024-11-24T03:46:50Z","timestamp":1732420010000},"page":"236-255","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Universal Construction for\u00a0Linearizable but\u00a0Not Strongly Linearizable Concurrent Objects"],"prefix":"10.1007","author":[{"given":"Chao","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gustavo","family":"Petri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiaowen","family":"Jia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youlin","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Lv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiming","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,25]]},"reference":[{"key":"13_CR1","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, 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"13_CR2","unstructured":"Golab, W.M., Higham, L., Woelfel, P.: Linearizable implementations do not suffice for randomized distributed computation. In: Fortnow, L., Vadhan, S.P. (eds.) Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6\u20138 June 2011, pp. 373\u2013382. ACM (2011)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-642-00590-9_19","volume-title":"Programming Languages and Systems","author":"I Filipovi\u0107","year":"2009","unstructured":"Filipovi\u0107, I., O\u2019Hearn, P., Rinetzky, N., Yang, H.: Abstraction for concurrent objects. In: Castagna, G. (ed.) ESOP 2009. LNCS, vol. 5502, pp. 252\u2013266. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00590-9_19"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1006\/inco.1995.1134","volume":"121","author":"N Lynch","year":"1995","unstructured":"Lynch, N., Vaandrager, F.: Forward and backward simulations. Inf. Comput. 121, 214\u2013233 (1995)","journal-title":"Inf. Comput."},{"key":"13_CR5","unstructured":"Rady, A.S.: Characterizing implementations that preserve properties of concurrent randomized algorithms (2017)"},{"key":"13_CR6","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann (2008)"},{"key":"13_CR7","unstructured":"Hwang, S.M., Woelfel, P.: Strongly linearizable linked list and queue. In: Bramas, Q., Gramoli, V., Milani, A. (eds.) 25th International Conference on Principles of Distributed Systems, OPODIS 2021. LIPIcs, Strasbourg, France, 13\u201315 December 2021, vol. 217, pp. 28:1\u201328:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Michael, M.M., Scott, M.L.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: Burns, J.E., Moses, Y. (eds.) Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, Philadelphia, Pennsylvania, USA, 23\u201326 May 1996, pp. 267\u2013275. ACM (1996)","DOI":"10.1145\/248052.248106"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-45414-4_21","volume-title":"Distributed Computing","author":"TL Harris","year":"2001","unstructured":"Harris, T.L.: A pragmatic implementation of non-blocking linked-lists. In: Welch, J. (ed.) DISC 2001. LNCS, vol. 2180, pp. 300\u2013314. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45414-4_21"},{"key":"13_CR10","unstructured":"Wang, C., Jia, Q., Lu, Y., Wu, P.: Strong linearizability checking and determining for concurrent objects. J. Softw. 35 (2024)"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0020-0190(88)90175-5","volume":"28","author":"K Vidyasankar","year":"1988","unstructured":"Vidyasankar, K.: Converting Lamport\u2019s regular register to atomic register. Inf. Process. Lett. 28, 287\u2013290 (1988)","journal-title":"Inf. Process. Lett."},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1145\/153724.153741","volume":"40","author":"Y Afek","year":"1993","unstructured":"Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic snapshots of shared memory. J. ACM 40, 873\u2013890 (1993)","journal-title":"J. ACM"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-540-77096-1_29","volume-title":"Principles of Distributed Systems","author":"M Hoffman","year":"2007","unstructured":"Hoffman, M., Shalev, O., Shavit, N.: The baskets queue. In: Tovar, E., Tsigas, P., Fouchal, H. (eds.) OPODIS 2007. LNCS, vol. 4878, pp. 401\u2013414. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77096-1_29"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Dodds, M., Haas, A., Kirsch, C.M.: A scalable, correct time-stamped stack. In: Rajamani, S.K., Walker, D. (eds.) Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2015, Mumbai, India, 15\u201317 January 2015, pp. 233\u2013246. ACM (2015)","DOI":"10.1145\/2676726.2676963"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Helmi, M., Higham, L., Woelfel, P.: Strongly linearizable implementations: possibilities and impossibilities. In: Kowalski, D., Panconesi, A. (eds.) ACM Symposium on Principles of Distributed Computing, PODC 2012, Funchal, Madeira, Portugal, 16\u201318 July 2012, pp. 385\u2013394. ACM (2012)","DOI":"10.1145\/2332432.2332508"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-662-48653-5_5","volume-title":"Distributed Computing","author":"O Denysyuk","year":"2015","unstructured":"Denysyuk, O., Woelfel, P.: Wait-freedom is harder than lock-freedom under strong linearizability. In: Moses, Y. (ed.) DISC 2015. LNCS, vol. 9363, pp. 60\u201374. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48653-5_5"},{"key":"13_CR17","unstructured":"Attiya, H., Enea, C., Welch, J.L.: Impossibility of strongly-linearizable message-passing objects via simulation by single-writer registers. In: Gilbert, S. (ed.) 35th International Symposium on Distributed Computing, DISC 2021. LIPIcs, Freiburg, Germany, 4\u20138 October 2021 (Virtual Conference), vol. 209, pp. 7:1\u20137:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Attiya, H., Casta\u00f1eda, A., Enea, C.: Strong linearizability using primitives with consensus number 2. In: Gelles, R., Olivetti, D., Kuznetsov, P. (eds.) Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, PODC 2024, Nantes, France, 17\u201321 June 2024, pp. 432\u2013442. ACM (2024)","DOI":"10.1145\/3662158.3662790"},{"key":"13_CR19","unstructured":"Attiya, H., Enea, C.: Putting strong linearizability in context: preserving hyperproperties in programsthat use concurrent objects. In: Suomela, J. (ed.) 33rd International Symposium on Distributed Computing, DISC 2019. LIPIcs, Budapest, Hungary, 14\u201318 October 2019, vol. 146, pp. 2:1\u20132:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.3233\/JCS-2009-0393","volume":"18","author":"MR Clarkson","year":"2010","unstructured":"Clarkson, M.R., Schneider, F.B.: Hyperproperties. J. Comput. Secur. 18, 1157\u20131210 (2010)","journal-title":"J. Comput. Secur."},{"key":"13_CR21","unstructured":"Wang, C., et al.: Universal construction for linearizable but not strongly linearizable concurrent objects. Technical report ISCAS-SKLCS-24-01, State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences (2024). https:\/\/lcs.ios.ac.cn\/~lvyi\/files\/ISCAS-SKLCS-24-01.pdf"},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13, 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-642-40184-8_17","volume-title":"CONCUR 2013 \u2013 Concurrency Theory","author":"H Liang","year":"2013","unstructured":"Liang, H., Hoffmann, J., Feng, X., Shao, Z.: Characterizing progress properties of concurrent objects via contextual refinements. In: D\u2019Argenio, P.R., Melgratti, H. (eds.) CONCUR 2013. LNCS, vol. 8052, pp. 227\u2013241. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40184-8_17"}],"container-title":["Lecture Notes in Computer Science","Dependable Software Engineering. Theories, Tools, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0602-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,24]],"date-time":"2024-11-24T04:19:25Z","timestamp":1732421965000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0602-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,25]]},"ISBN":["9789819606016","9789819606023"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0602-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,11,25]]},"assertion":[{"value":"25 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SETTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Dependable Software Engineering: Theories, Tools, and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"setta2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/setta2024.cs.cityu.edu.hk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}