{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T12:25:51Z","timestamp":1780316751187,"version":"3.54.1"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031352560","type":"print"},{"value":"9783031352577","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-35257-7_12","type":"book-chapter","created":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T23:02:32Z","timestamp":1687820552000},"page":"202-220","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["VeriLin: A Linearizability Checker for\u00a0Large-Scale Concurrent Objects"],"prefix":"10.1007","author":[{"given":"Qiaowen","family":"Jia","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yi","family":"Lv","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peng","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bohua","family":"Zhan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jifeng","family":"Hao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hong","family":"Ye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,6,27]]},"reference":[{"key":"12_CR1","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. (TOPLAS) 12, 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"12_CR2","unstructured":"Herlihy, M., Shavit, N., Luchangco, V., Spear, M.: The art of multiprocessor programming. Newnes (2020)"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"4379","DOI":"10.1016\/j.tcs.2010.09.021","volume":"411","author":"I Filipovic","year":"2010","unstructured":"Filipovic, I., O\u2019Hearn, P.W., Rinetzky, N., Yang, H.: Abstraction for concurrent objects. Theor. Comput. Sci. 411, 4379\u20134398 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Vafeiadis, V., Herlihy, M., Hoare, T., Shapiro, M.: Proving correctness of highly-concurrent linearisable objects. In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP 2006, New York, New York, USA, 29\u201331 March 2006, pp. 129\u2013136 (2006)","DOI":"10.1145\/1122971.1122992"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Liang, H., Feng, X.: Modular verification of linearizability with non-fixed linearization points. In: Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 459\u2013470 (2013)","DOI":"10.1145\/2491956.2462189"},{"key":"12_CR6","unstructured":"Vafeiadis, V.: Modular fine-grained concurrency verification. Technical report, University of Cambridge, Computer Laboratory (2008)"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1006\/inco.1999.2847","volume":"160","author":"R Alur","year":"2000","unstructured":"Alur, R., McMillan, K., Peled, D.: Model-checking of correctness conditions for concurrent objects. Inf. Comput. 160, 167\u2013188 (2000)","journal-title":"Inf. Comput."},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-642-37036-6_17","volume-title":"Programming Languages and Systems","author":"A Bouajjani","year":"2013","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). https:\/\/doi.org\/10.1007\/978-3-642-37036-6_17"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1006\/jpdc.1993.1015","volume":"17","author":"JM Wing","year":"1993","unstructured":"Wing, J.M., Gong, C.: Testing and verifying concurrent objects. J. Parallel Distrib. Comput. 17, 164\u2013182 (1993)","journal-title":"J. Parallel Distrib. Comput."},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"1208","DOI":"10.1137\/S0097539794279614","volume":"26","author":"PB Gibbons","year":"1997","unstructured":"Gibbons, P.B., Korach, E.: Testing shared memories. SIAM J. Comput. 26, 1208\u20131244 (1997)","journal-title":"SIAM J. Comput."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Emmi, M., Enea, C., Hamza, J.: Monitoring refinement via symbolic reasoning. In: Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, Portland, OR, USA, 15\u201317 June 2015, pp. 260\u2013269 (2015)","DOI":"10.1145\/2737924.2737983"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Emmi, M., Enea, C.: Sound, complete, and tractable linearizability monitoring for concurrent collections. Proc. ACM Program. Lang. 2, 25:1\u201325:27 (2018)","DOI":"10.1145\/3158113"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Michael, M.M., Scott, M.L.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 267\u2013275 (1996)","DOI":"10.1145\/248052.248106"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1145\/2775051.2676963","volume":"50","author":"M Dodds","year":"2015","unstructured":"Dodds, M., Haas, A., Kirsch, C.M.: A scalable, correct time-stamped stack. ACM SIGPLAN Not. 50, 233\u2013246 (2015)","journal-title":"ACM SIGPLAN Not."},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Burckhardt, S., Dern, C., Musuvathi, M., Tan, R.: Line-up: a complete and automatic linearizability checker. In: Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 330\u2013340 (2010)","DOI":"10.1145\/1806596.1806634"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-642-31424-7_21","volume-title":"Computer Aided Verification","author":"G Schellhorn","year":"2012","unstructured":"Schellhorn, G., Wehrheim, H., Derrick, J.: How to prove algorithms linearisable. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 243\u2013259. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31424-7_21"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Long, Z., Zhang, Y.: Checking linearizability with fine-grained traces. In: Proceedings of the 31st Annual ACM Symposium on Applied Computing, pp. 1394\u20131400 (2016)","DOI":"10.1145\/2851613.2851774"},{"key":"12_CR18","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.3928","volume":"29","author":"G Lowe","year":"2017","unstructured":"Lowe, G.: Testing for linearizability. Concurrency Comput. Pract. Experience 29, e3928 (2017)","journal-title":"Concurrency Comput. Pract. Experience"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-319-19195-9_4","volume-title":"Formal Techniques for Distributed Objects, Components, and Systems","author":"A Horn","year":"2015","unstructured":"Horn, A., Kroening, D.: Faster linearizability checking via P-compositionality. In: Graf, S., Viswanathan, M. (eds.) FORTE 2015. LNCS, vol. 9039, pp. 50\u201365. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19195-9_4"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Koval, N., Sokolova, M., Fedorov, A., Alistarh, D., Tsitelov, D.: Testing concurrency on the JVM with lincheck. In: Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 423\u2013424 (2020)","DOI":"10.1145\/3332466.3374503"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Bouajjani, A., Emmi, M., Enea, C., Hamza, J.: Tractable refinement checking for concurrent objects. In: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2015, Mumbai, India, 15\u201317 January 2015, pp. 651\u2013662 (2015)","DOI":"10.1145\/2676726.2677002"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1007\/978-3-030-25543-5_30","volume-title":"Computer Aided Verification","author":"M Emmi","year":"2019","unstructured":"Emmi, M., Enea, C.: Violat: generating tests of observational refinement for concurrent objects. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11562, pp. 534\u2013546. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25543-5_30"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-319-96145-3_26","volume-title":"Computer Aided Verification","author":"M Emmi","year":"2018","unstructured":"Emmi, M., Enea, C.: Monitoring weak consistency. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10981, pp. 487\u2013506. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96145-3_26"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Emmi, M., Enea, C.: Weak-consistency specification via visibility relaxation. Proc. ACM Program. Lang. 3, 60:1\u201360:28 (2019)","DOI":"10.1145\/3290373"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Ozkan, B.K., Majumdar, R., Niksic, F.: Checking linearizability using hitting families. In: Hollingsworth, J.K., Keidar, I. (eds.) Proceedings of the 24th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, 16\u201320 February 2019, pp. 366\u2013377. ACM (2019)","DOI":"10.1145\/3293883.3295726"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Godefroid, P.: Model checking for programming languages using VeriSoft. In: Proceedings of the 24th ACM Symposium on Principles of Programming Languages (POPL 1997), pp. 174\u2013186 (1997)","DOI":"10.1145\/263699.263717"},{"key":"12_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-540-71410-1_2","volume-title":"Logic-Based Program Synthesis and Transformation","author":"M Musuvathi","year":"2007","unstructured":"Musuvathi, M., Qadeer, S.: CHESS: systematic stress testing of concurrent software. In: Puebla, G. (ed.) LOPSTR 2006. LNCS, vol. 4407, pp. 15\u201316. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71410-1_2"},{"key":"12_CR28","unstructured":"Musuvathi, M., Qadeer, S., Ball, T., Basler, G., Nainar, P.A., Neamtiu, I.: Finding and reproducing heisenbugs in concurrent programs. In: Proceedings of the 8th USENIX Conference on Operating Systems Design and Implementation (OSDI 2008), pp. 267\u2013280 (2008)"},{"key":"12_CR29","doi-asserted-by":"crossref","unstructured":"Yu, J., Narayanasamy, S., Pereira, C., Pokam, G.: Maple: A coverage-driven testing tool for multithreaded programs. In: Proceedings of ACM International Conference on Object Oriented Programming Systems Languages and Applications (OOPSLA 2012), pp. 485\u2013502 (2012)","DOI":"10.1145\/2398857.2384651"},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Sen, K.: Race directed random testing of concurrent programs. In: Proceedings of the 29th ACM International Conference on Programming Language Design and Implementation (PLDI 2008), pp. 11\u201321 (2008)","DOI":"10.1145\/1375581.1375584"},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"Zhang, W., Sun, C., Lu, S.: ConMem: detecting severe concurrency bugs through an effect-oriented approach. In: Proceedings of the 15th ACM International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS XV), pp. 179\u2013192 (2010)","DOI":"10.1145\/1735971.1736041"},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"Yue, H., Wu, P., Chen, T.Y., Lv, Y.: Input-driven active testing of multi-threaded programs. In: Proceedings of 2015 Asia-Pacific Software Engineering Conference (APSEC 2015), pp. 246\u2013253 (2015)","DOI":"10.1109\/APSEC.2015.34"},{"key":"12_CR33","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.infsof.2018.07.001","volume":"103","author":"L Ma","year":"2018","unstructured":"Ma, L., Wu, P., Chen, T.Y.: Diversity driven adaptive test generation for concurrent data structures. Inf. Softw. Technol. 103, 162\u2013173 (2018)","journal-title":"Inf. Softw. Technol."}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-35257-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T23:04:31Z","timestamp":1687820671000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-35257-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031352560","9783031352577"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-35257-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TASE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Theoretical Aspects of Software Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bristol","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tase2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/bristolpl.github.io\/tase2023\/","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":"49","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":"19","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":"2","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":"39% - 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","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":"3","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)"}}]}}