{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:43:44Z","timestamp":1743140624921,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319519623"},{"type":"electronic","value":"9783319519630"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-51963-0_15","type":"book-chapter","created":{"date-parts":[[2017,1,10]],"date-time":"2017-01-10T01:17:39Z","timestamp":1484011059000},"page":"188-202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Decomposable Relaxation for Concurrent Data Structures"],"prefix":"10.1007","author":[{"given":"Chao","family":"Wang","sequence":"first","affiliation":[]},{"given":"Yi","family":"Lv","sequence":"additional","affiliation":[]},{"given":"Peng","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,11]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Haziza, F., Hol\u00edk, L., Jonsson, B., Rezine, A.: An integrated specification and verification technique for highly concurrent data structures. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 324\u2013338. Springer, Heidelberg (2013). doi:\n                      10.1007\/978-3-642-36742-7_23","DOI":"10.1007\/978-3-642-36742-7_23"},{"key":"15_CR2","doi-asserted-by":"publisher","unstructured":"Adhikari, K., Street, J., Wang, C., Liu, Y., Zhang, S.J.: Verifying a quantitative relaxation of linearizability via refinement. In: Bartocci, E., Ramakrishnan, C.R. (eds.) SPIN 2013. LNCS, vol. 7976, pp. 24\u201342. Springer, Heidelberg (2013). doi:\n                      10.1007\/978-3-642-39176-7_3","DOI":"10.1007\/978-3-642-39176-7_3"},{"key":"15_CR3","doi-asserted-by":"publisher","unstructured":"Afek, Y., Korland, G., Yanovsky, E.: Quasi-linearizability: relaxed consistency for improved concurrency. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol. 6490, pp. 395\u2013410. Springer, Heidelberg (2010). doi:\n                      10.1007\/978-3-642-17653-1_29","DOI":"10.1007\/978-3-642-17653-1_29"},{"key":"15_CR4","doi-asserted-by":"publisher","unstructured":"Bouajjani, A., Emmi, M., Enea, C., Hamza, J.: On reducing linearizability to state reachability. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 95\u2013107. Springer, Heidelberg (2015). doi:\n                      10.1007\/978-3-662-47666-6_8","DOI":"10.1007\/978-3-662-47666-6_8"},{"key":"15_CR5","doi-asserted-by":"publisher","unstructured":"Bouajjani, A., Emmi, M., Enea, C., Hamza, J.: Verifying concurrent programs against sequential specifications. In: Felleisen, M., Gardner, P. (eds.) ESOP 2013. LNCS, vol. 7792, pp. 290\u2013309. Springer, Heidelberg (2013). doi:\n                      10.1007\/978-3-642-37036-6_17","DOI":"10.1007\/978-3-642-37036-6_17"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Haas, A., Lippautz, M., Henzinger, T.A., Payer, H., Sokolova, A., Kirsch, C.M., Sezgin, A.: Distributed queues in shared memory: multicore performance and scalability through quantitative relaxation. In: CF 2013, p. 17: 1\u201317: 9 (2013)","DOI":"10.1145\/2482767.2482789"},{"key":"15_CR7","first-page":"317","volume":"2013","author":"TA Henzinger","year":"2013","unstructured":"Henzinger, T.A., Kirsch, C.M., Payer, H., Sezgin, A., Sokolova, A.: Quantitative relaxation of concurrent data structures. POPL 2013, 317\u2013328 (2013)","journal-title":"POPL"},{"key":"15_CR8","doi-asserted-by":"publisher","unstructured":"Henzinger, T.A., Sezgin, A., Vafeiadis, V.: Aspect-Oriented Linearizability Proofs. In: D\u2019Argenio, P.R., Melgratti, H. (eds.) CONCUR 2013. LNCS, vol. 8052, pp. 242\u2013256. Springer, Heidelberg (2013). doi:\n                      10.1007\/978-3-642-40184-8_18","DOI":"10.1007\/978-3-642-40184-8_18"},{"issue":"3","key":"15_CR9","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"MP Herlihy","year":"1990","unstructured":"Herlihy, M.P., 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":"15_CR10","doi-asserted-by":"publisher","unstructured":"Kirsch, C.M., Lippautz, M., Payer, H.: Fast and scalable, lock-free k-FIFO queues. In: Malyshkin, V. (ed.) PaCT 2013. LNCS, vol. 7979, pp. 208\u2013223. Springer, Heidelberg (2013). doi:\n                      10.1007\/978-3-642-39958-9_18","DOI":"10.1007\/978-3-642-39958-9_18"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Kirsch, C.M., Payer, H., R\u00f6ck, H., Sokolova, A.: Performance, scalability, and semantics of concurrent FIFO queues. In: ICA3p. 2012, Part I, pp. 273\u2013287 (2012)","DOI":"10.1007\/978-3-642-33078-0_20"},{"key":"15_CR12","first-page":"459","volume":"2013","author":"H Liang","year":"2013","unstructured":"Liang, H., Feng, X.: Modular verification of linearizability with non-fixed linearization points. PLDI 2013, 459\u2013470 (2013)","journal-title":"PLDI"},{"key":"15_CR13","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1145\/248052.248106","volume":"1996","author":"MM Michael","year":"1996","unstructured":"Michael, M.M., Scott, M.L.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. PODC 1996, 267\u2013275 (1996)","journal-title":"PODC"},{"key":"15_CR14","unstructured":"Wang, C., Lv, Y., Wu, P.: Decomposable relaxation for concurrent data structures. Technical report ISCAS-SKLCS-16-01, State Key Laboratory of Computer Science, ISCAS, CAS (2016). \n                      http:\/\/lcs.ios.ac.cn\/ lvyi\/files\/ISCAS-SKLCS-16-01.pdf"},{"key":"15_CR15","doi-asserted-by":"publisher","unstructured":"Wang, C., Lv, Y., Liu, G., Wu, P.: Quasi-linearizability is undecidable. In: Feng, X., Park, S. (eds.) APLAS 2015. LNCS, vol. 9458, pp. 369\u2013386. Springer, Heidelberg (2015). doi:\n                      10.1007\/978-3-319-26529-2_20","DOI":"10.1007\/978-3-319-26529-2_20"},{"key":"15_CR16","first-page":"184","volume":"18986","author":"P Wolper","year":"1986","unstructured":"Wolper, P.: Expressing interesting properties of programs in propositional temporal logic. POPL 18986, 184\u2013193 (1986)","journal-title":"POPL"},{"key":"15_CR17","first-page":"4","volume":"2013","author":"L Zhang","year":"2013","unstructured":"Zhang, L., Chattopadhyay, A., Wang, C.: Round-up: runtime checking quasi linearizability of concurrent data structures. ASE 2013, 4\u201314 (2013)","journal-title":"ASE"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2017: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-51963-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T02:03:28Z","timestamp":1558317808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-51963-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319519623","9783319519630"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-51963-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"11 January 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Limerick","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 January 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}