{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T20:51:48Z","timestamp":1760043108488,"version":"3.37.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319961446"},{"type":"electronic","value":"9783319961453"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-96145-3_26","type":"book-chapter","created":{"date-parts":[[2018,7,20]],"date-time":"2018-07-20T18:25:55Z","timestamp":1532111155000},"page":"487-506","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Monitoring Weak Consistency"],"prefix":"10.1007","author":[{"given":"Michael","family":"Emmi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Constantin","family":"Enea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,18]]},"reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-642-36742-7_23","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"PA Abdulla","year":"2013","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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-36742-7_23"},{"issue":"1","key":"26_CR2","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BF01784241","volume":"9","author":"M Ahamad","year":"1995","unstructured":"Ahamad, M., Neiger, G., Burns, J.E., Kohli, P., Hutto, P.W.: Causal memory: definitions, implementation, and programming. Distrib. Comput. 9(1), 37\u201349 (1995). \nhttps:\/\/doi.org\/10.1007\/BF01784241","journal-title":"Distrib. Comput."},{"issue":"1\u20132","key":"26_CR3","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.L., Peled, D.A.: Model-checking of correctness conditions for concurrent objects. Inf. Comput. 160(1\u20132), 167\u2013188 (2000). \nhttps:\/\/doi.org\/10.1006\/inco.1999.2847","journal-title":"Inf. Comput."},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-540-73368-3_49","volume-title":"Computer Aided Verification","author":"D Amit","year":"2007","unstructured":"Amit, D., Rinetzky, N., Reps, T., Sagiv, M., Yahav, E.: Comparison under abstraction for verifying linearizability. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 477\u2013490. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-73368-3_49"},{"key":"26_CR5","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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-37036-6_17"},{"key":"26_CR6","doi-asserted-by":"publisher","unstructured":"Bouajjani, A., Emmi, M., Enea, C., Hamza, J.: Tractable refinement checking for concurrent objects. In: Rajamani, S.K., Walker, D. (eds.) Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2015, 15\u201317 January 2015, Mumbai, India, pp. 651\u2013662. ACM (2015). \nhttps:\/\/doi.org\/10.1145\/2676726.2677002","DOI":"10.1145\/2676726.2677002"},{"key":"26_CR7","unstructured":"Bouajjani, A., Enea, C., Guerraoui, R., Hamza, J.: On verifying causal consistency. In: Castagna, G., Gordon, A.D. (eds.) Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, 18\u201320 January 2017, Paris, France, pp. 626\u2013638. ACM (2017). \nhttp:\/\/dl.acm.org\/citation.cfm?id=3009888"},{"key":"26_CR8","doi-asserted-by":"publisher","unstructured":"Bouajjani, A., Enea, C., Hamza, J.: Verifying eventual consistency of optimistic replication systems. In: Jagannathan, S., Sewell, P. (eds.) The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2014, 20\u201321 January 2014, San Diego, CA, USA, pp. 285\u2013296. ACM (2014). \nhttps:\/\/doi.org\/10.1145\/2535838.2535877","DOI":"10.1145\/2535838.2535877"},{"issue":"1\u20132","key":"26_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2500000011","volume":"1","author":"S Burckhardt","year":"2014","unstructured":"Burckhardt, S.: Principles of eventual consistency. Found. Trends Program. Lang. 1(1\u20132), 1\u2013150 (2014). \nhttps:\/\/doi.org\/10.1561\/2500000011","journal-title":"Found. Trends Program. Lang."},{"key":"26_CR10","doi-asserted-by":"publisher","unstructured":"Burckhardt, S., Dern, C., Musuvathi, M., Tan, R.: Line-up: a complete and automatic linearizability checker. In: Zorn, B.G., Aiken, A. (eds.) Proceedings of the 2010 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2010, 5\u201310 June 2010, Toronto, Ontario, Canada, pp. 330\u2013340. ACM (2010). \nhttps:\/\/doi.org\/10.1145\/1806596.1806634","DOI":"10.1145\/1806596.1806634"},{"key":"26_CR11","doi-asserted-by":"publisher","unstructured":"Burckhardt, S., Gotsman, A., Yang, H., Zawirski, M.: Replicated data types: specification, verification, optimality. In: Jagannathan, S., Sewell, P. (eds.) The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2014, 20\u201321 January 2014, San Diego, CA, USA, pp. 271\u2013284. ACM (2014). \nhttps:\/\/doi.org\/10.1145\/2535838.2535848","DOI":"10.1145\/2535838.2535848"},{"key":"26_CR12","doi-asserted-by":"publisher","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, 15\u201317 January 2015, Mumbai, India, pp. 233\u2013246. ACM (2015). \nhttps:\/\/doi.org\/10.1145\/2676726.2676963","DOI":"10.1145\/2676726.2676963"},{"key":"26_CR13","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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-39799-8_11"},{"key":"26_CR14","unstructured":"Emmi, M., Enea, C.: Exposing non-atomic methods of concurrent objects. CoRR abs\/1706.09305 (2017). \nhttp:\/\/arxiv.org\/abs\/1706.09305"},{"key":"26_CR15","doi-asserted-by":"publisher","unstructured":"Emmi, M., Enea, C.: Sound, complete, and tractable linearizability monitoring for concurrent collections. PACMPL 2(POPL), 25:1\u201325:27 (2018). \nhttps:\/\/doi.org\/10.1145\/3158113","DOI":"10.1145\/3158113"},{"key":"26_CR16","doi-asserted-by":"publisher","unstructured":"Emmi, M., Enea, C., Hamza, J.: Monitoring refinement via symbolic reasoning. In: Grove, D., Blackburn, S. (eds.) Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, 15\u201317 June 2015, Portland, OR, USA, pp. 260\u2013269. ACM (2015). \nhttps:\/\/doi.org\/10.1145\/2737924.2737983","DOI":"10.1145\/2737924.2737983"},{"issue":"2","key":"26_CR17","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985). \nhttps:\/\/doi.org\/10.1145\/3149.214121","journal-title":"J. ACM"},{"issue":"4","key":"26_CR18","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(4), 1208\u20131244 (1997). \nhttps:\/\/doi.org\/10.1137\/S0097539794279614","journal-title":"SIAM J. Comput."},{"issue":"2","key":"26_CR19","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/564585.564601","volume":"33","author":"S Gilbert","year":"2002","unstructured":"Gilbert, S., Lynch, N.A.: Brewer\u2019s conjecture and the feasibility of consistent, available, partition-tolerant web services. SIGACT News 33(2), 51\u201359 (2002). \nhttps:\/\/doi.org\/10.1145\/564585.564601","journal-title":"SIGACT News"},{"key":"26_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-319-26850-7_21","volume-title":"Networked Systems","author":"J Hamza","year":"2015","unstructured":"Hamza, J.: On the complexity of linearizability. In: Bouajjani, A., Fauconnier, H. (eds.) NETYS 2015. LNCS, vol. 9466, pp. 308\u2013321. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-26850-7_21"},{"key":"26_CR21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-40184-8_18","volume-title":"CONCUR 2013","author":"TA Henzinger","year":"2013","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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-40184-8_18"},{"issue":"3","key":"26_CR22","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). \nhttps:\/\/doi.org\/10.1145\/78969.78972","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"26_CR23","doi-asserted-by":"publisher","unstructured":"Kawell Jr., L., Beckhardt, S., Halvorsen, T., Ozzie, R., Greif, I.: Replicated document management in a group communication system. In: Proceedings of the 1988 ACM Conference on Computer-Supported Cooperative Work, p. 395. CSCW 1988. ACM, New York (1988). \nhttps:\/\/doi.org\/10.1145\/62266.1024798","DOI":"10.1145\/62266.1024798"},{"key":"26_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-319-48989-6_26","volume-title":"FM 2016: Formal Methods","author":"A Khyzha","year":"2016","unstructured":"Khyzha, A., Gotsman, A., Parkinson, M.: A generic logic for proving linearizability. In: Fitzgerald, J., Heitmeyer, C., Gnesi, S., Philippou, A. (eds.) FM 2016. LNCS, vol. 9995, pp. 426\u2013443. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-48989-6_26"},{"issue":"7","key":"26_CR25","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L Lamport","year":"1978","unstructured":"Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558\u2013565 (1978). \nhttps:\/\/doi.org\/10.1145\/359545.359563","journal-title":"Commun. ACM"},{"key":"26_CR26","doi-asserted-by":"publisher","unstructured":"Liang, H., Feng, X.: Modular verification of linearizability with non-fixed linearization points. In: Boehm, H., Flanagan, C. (eds.) ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2013, 16\u201319 June 2013, Seattle, WA, USA, pp. 459\u2013470. ACM (2013). \nhttps:\/\/doi.org\/10.1145\/2462156.2462189","DOI":"10.1145\/2462156.2462189"},{"key":"26_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-05089-3_21","volume-title":"FM 2009: Formal Methods","author":"Y Liu","year":"2009","unstructured":"Liu, Y., Chen, W., Liu, Y.A., Sun, J.: Model checking linearizability via refinement. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol. 5850, pp. 321\u2013337. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-05089-3_21"},{"key":"26_CR28","doi-asserted-by":"publisher","unstructured":"Lloyd, W., Freedman, M.J., Kaminsky, M., Andersen, D.G.: Don\u2019t settle for eventual: scalable causal consistency for wide-area storage with COPS. In: Wobber, T., Druschel, P. (eds.) Proceedings of the 23rd ACM Symposium on Operating Systems Principles 2011, SOSP 2011, 23\u201326 October 2011, Cascais, Portugal, pp. 401\u2013416. ACM (2011). \nhttps:\/\/doi.org\/10.1145\/2043556.2043593","DOI":"10.1145\/2043556.2043593"},{"key":"26_CR29","doi-asserted-by":"publisher","unstructured":"Lowe, G.: Testing for linearizability. Concurr. Comput.: Pract. Exp. 29(4) (2017). \nhttps:\/\/doi.org\/10.1002\/cpe.3928","DOI":"10.1002\/cpe.3928"},{"key":"26_CR30","doi-asserted-by":"publisher","unstructured":"O\u2019Hearn, P.W., Rinetzky, N., Vechev, M.T., Yahav, E., Yorsh, G.: Verifying linearizability with hindsight. In: Richa, A.W., Guerraoui, R. (eds.) Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, 25\u201328 July 2010, Zurich, Switzerland, pp. 85\u201394. ACM (2010). \nhttps:\/\/doi.org\/10.1145\/1835698.1835722","DOI":"10.1145\/1835698.1835722"},{"key":"26_CR31","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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-31424-7_21"},{"key":"26_CR32","doi-asserted-by":"publisher","unstructured":"Sergey, I., Nanevski, A., Banerjee, A.: Mechanized verification of fine-grained concurrent programs. In: Grove, D., Blackburn, S. (eds.) Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, 15\u201317 June 2015, Portland, OR, USA, pp. 77\u201387. ACM (2015). \nhttps:\/\/doi.org\/10.1145\/2737924.2737964","DOI":"10.1145\/2737924.2737964"},{"key":"26_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-662-46669-8_14","volume-title":"Programming Languages and Systems","author":"I Sergey","year":"2015","unstructured":"Sergey, I., Nanevski, A., Banerjee, A.: Specifying and verifying concurrent algorithms with histories and subjectivity. In: Vitek, J. (ed.) ESOP 2015. LNCS, vol. 9032, pp. 333\u2013358. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-46669-8_14"},{"key":"26_CR34","doi-asserted-by":"publisher","unstructured":"Shacham, O., Bronson, N.G., Aiken, A., Sagiv, M., Vechev, M.T., Yahav, E.: Testing atomicity of composed concurrent operations. In: Lopes, C.V., Fisher, K. (eds.) Proceedings of the 26th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2011, part of SPLASH 2011, 22\u201327 October 2011, Portland, OR, USA, pp. 51\u201364. ACM (2011). \nhttps:\/\/doi.org\/10.1145\/2048066.2048073","DOI":"10.1145\/2048066.2048073"},{"key":"26_CR35","doi-asserted-by":"crossref","unstructured":"Terry, D.B., Demers, A.J., Petersen, K., Spreitzer, M.J., Theimer, M.M., Welch, B.B.: Session guarantees for weakly consistent replicated data. In: Proceedings of the Third International Conference on on Parallel and Distributed Information Systems, PDIS 1994, pp. 140\u2013150. IEEE Computer Society Press, Los Alamitos (1994). \nhttp:\/\/dl.acm.org\/citation.cfm?id=381992.383631","DOI":"10.1109\/PDIS.1994.331722"},{"key":"26_CR36","doi-asserted-by":"publisher","unstructured":"Terry, D.B., Theimer, M., Petersen, K., Demers, A.J., Spreitzer, M., Hauser, C.: Managing update conflicts in bayou, a weakly connected replicated storage system. In: Jones, M.B. (ed.) Proceedings of the Fifteenth ACM Symposium on Operating System Principles, SOSP 1995, 3\u20136 December 1995, Copper Mountain Resort, Colorado, USA, pp. 172\u2013183. ACM (1995). \nhttps:\/\/doi.org\/10.1145\/224056.224070","DOI":"10.1145\/224056.224070"},{"key":"26_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-642-14295-6_40","volume-title":"Computer Aided Verification","author":"V Vafeiadis","year":"2010","unstructured":"Vafeiadis, V.: Automatically proving linearizability. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 450\u2013464. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-14295-6_40"},{"issue":"1\u20132","key":"26_CR38","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(1\u20132), 164\u2013182 (1993). \nhttps:\/\/doi.org\/10.1006\/jpdc.1993.1015","journal-title":"J. Parallel Distrib. Comput."},{"key":"26_CR39","doi-asserted-by":"publisher","unstructured":"Zhang, S.J.: Scalable automatic linearizability checking. In: Taylor, R.N., Gall, H.C., Medvidovic, N. (eds.) Proceedings of the 33rd International Conference on Software Engineering, ICSE 2011, 21\u201328 May 2011, Waikiki, Honolulu, HI, USA, pp. 1185\u20131187. ACM (2011). \nhttps:\/\/doi.org\/10.1145\/1985793.1986037","DOI":"10.1145\/1985793.1986037"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96145-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,20]],"date-time":"2018-07-20T18:51:30Z","timestamp":1532112690000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-96145-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319961446","9783319961453"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96145-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}