{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T02:15:24Z","timestamp":1775873724753,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030393212","type":"print"},{"value":"9783030393229","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-39322-9_18","type":"book-chapter","created":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T19:03:59Z","timestamp":1579028639000},"page":"379-400","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Formalizing and Checking Multilevel\u00a0Consistency"],"prefix":"10.1007","author":[{"given":"Ahmed","family":"Bouajjani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Constantin","family":"Enea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Madhavan","family":"Mukund","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gautham","family":"Shenoy R.","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. P.","family":"Suresh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,13]]},"reference":[{"key":"18_CR1","unstructured":"Amazon DynamoDB Developer Guide (API Version 2012\u201308-10): DAX and DynamoDB consistency Models (2018). https:\/\/docs.aws.amazon.com\/amazondynamodb\/latest\/developerguide\/DAX.consistency.html. Accessed 26 Sep 2019"},{"key":"18_CR2","doi-asserted-by":"publisher","unstructured":"Bailis, P., Ghodsi, A., Hellerstein, J.M., Stoica, I.: Bolt-on causal consistency. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, SIGMOD 2013, pp. 761\u2013772. ACM, New York (2013). https:\/\/doi.org\/10.1145\/2463676.2465279","DOI":"10.1145\/2463676.2465279"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-030-25543-5_19","volume-title":"Computer Aided Verification","author":"R Biswas","year":"2019","unstructured":"Biswas, R., Emmi, M., Enea, C.: On the complexity of checking consistency for replicated data types. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11562, pp. 324\u2013343. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25543-5_19"},{"issue":"OOPSLA","key":"18_CR4","doi-asserted-by":"publisher","first-page":"165:1","DOI":"10.1145\/3360591","volume":"3","author":"R Biswas","year":"2019","unstructured":"Biswas, R., Enea, C.: On the complexity of checking transactional consistency. Proc. ACM Program. Lang. 3(OOPSLA), 165:1\u2013165:28 (2019). https:\/\/doi.org\/10.1145\/3360591","journal-title":"Proc. ACM Program. Lang."},{"issue":"3","key":"18_CR5","doi-asserted-by":"publisher","first-page":"10:1","DOI":"10.1145\/2518188","volume":"35","author":"A Bouajjani","year":"2013","unstructured":"Bouajjani, A., Emmi, M.: Analysis of recursively parallel programs. ACM Trans. Program. Lang. Syst. 35(3), 10:1\u201310:49 (2013). https:\/\/doi.org\/10.1145\/2518188","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"18_CR6","doi-asserted-by":"publisher","unstructured":"Bouajjani, A., Enea, C., Guerraoui, R., Hamza, J.: On verifying causal consistency. In: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, pp. 626\u2013638. ACM, New York (2017). https:\/\/doi.org\/10.1145\/3009837.3009888","DOI":"10.1145\/3009837.3009888"},{"key":"18_CR7","doi-asserted-by":"publisher","unstructured":"Bouajjani, A., Enea, C., Hamza, J.: Verifying eventual consistency of optimistic replication systems. In: The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2014, San Diego, CA, USA, January 20\u201321, 2014, pp. 285\u2013296 (2014). https:\/\/doi.org\/10.1145\/2535838.2535877","DOI":"10.1145\/2535838.2535877"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Bouajjani, A., Enea, C., Mukund, M., Shenoy, R.G., Suresh, S.P.: Formalizing and checking multilevel consistency. Tech. rep., Chennai Mathematical Institute (2019). http:\/\/www.cmi.ac.in\/~spsuresh\/pdfs\/vmcai2020-tr.pdf","DOI":"10.1007\/978-3-030-39322-9_18"},{"issue":"1\u20132","key":"18_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). https:\/\/doi.org\/10.1561\/2500000011","journal-title":"Found. Trends Program. Lang."},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Burkhardt, S., Gotsman, A., Yang, H., Zawirski, M.: Replicated data types: specification, verification, optimality. In: The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2014, San Diego, CA, USA, January 20\u201321, 2014, pp. 271\u2013284 (2014)","DOI":"10.1145\/2535838.2535848"},{"key":"18_CR11","unstructured":"Damien: DynamoDB vs Cassandra (2017). https:\/\/www.beyondthelines.net\/databases\/dynamodb-vs-cassandra\/. Accessed 16 Nov 2018"},{"key":"18_CR12","doi-asserted-by":"publisher","unstructured":"Dongol, B., Hierons, R.M.: Decidability and complexity for quiescent consistency. In: Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2016, pp. 116\u2013125. ACM, New York (2016). https:\/\/doi.org\/10.1145\/2933575.2933576","DOI":"10.1145\/2933575.2933576"},{"key":"18_CR13","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":"18_CR14","doi-asserted-by":"publisher","unstructured":"Furbach, F., Meyer, R., Schneider, K., Senftleben, M.: Memory model-aware testing - a unified complexity analysis. In: 14th International Conference on Application of Concurrency to System Design, ACSD 2014, Tunis La Marsa, Tunisia, June 23\u201327, 2014, pp. 92\u2013101 (2014). https:\/\/doi.org\/10.1109\/ACSD.2014.27","DOI":"10.1109\/ACSD.2014.27"},{"issue":"2","key":"18_CR15","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)","journal-title":"SIGACT News"},{"key":"18_CR16","doi-asserted-by":"publisher","unstructured":"Gotsman, A., Yang, H., Ferreira, C., Najafzadeh, M., Shapiro, M.: \u2019cause i\u2019m strong enough: reasoning about consistency choices in distributed systems. In: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2016, St. Petersburg, FL, USA, January 20\u201322, 2016, pp. 371\u2013384 (2016). https:\/\/doi.org\/10.1145\/2837614.2837625","DOI":"10.1145\/2837614.2837625"},{"key":"18_CR17","unstructured":"Guerraoui, R., Pavlovic, M., Seredinschi, D.A.: Incremental consistency guarantees for replicated objects. In: Proceedings of the 12th USENIX Conference on Operating Systems Design and Implementation, OSDI 2016, pp. 169\u2013184. USENIX Association, Berkeley (2016). http:\/\/dl.acm.org\/citation.cfm?id=3026877.3026891"},{"issue":"1","key":"18_CR18","first-page":"253","volume":"2","author":"T Kraska","year":"2009","unstructured":"Kraska, T., Hentschel, M., Alonso, G., Kossmann, D.: Consistency rationing in the cloud: pay only when it matters. PVLDB 2(1), 253\u2013264 (2009). http:\/\/www.vldb.org\/pvldb\/2\/vldb09-759.pdf","journal-title":"PVLDB"},{"issue":"9","key":"18_CR19","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1109\/TC.1979.1675439","volume":"28","author":"L Lamport","year":"1979","unstructured":"Lamport, L.: How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comput. 28(9), 690\u2013691 (1979)","journal-title":"IEEE Trans. Comput."},{"key":"18_CR20","unstructured":"Li, C., Porto, D., Clement, A., Gehrke, J., Pregui\u00e7a, N., Rodrigues, R.: Making geo-replicated systems fast as possible, consistent when necessary. In: Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation, OSDI 2012, pp. 265\u2013278. USENIX Association, Berkeley (2012). http:\/\/dl.acm.org\/citation.cfm?id=2387880.2387906"},{"issue":"OOPSLA","key":"18_CR21","doi-asserted-by":"publisher","first-page":"160:1","DOI":"10.1145\/3276530","volume":"2","author":"BK Ozkan","year":"2018","unstructured":"Ozkan, B.K., Majumdar, R., Niksic, F., Befrouei, M.T., Weissenbacher, G.: Randomized testing of distributed systems with probabilistic guarantees. PACMPL 2(OOPSLA), 160:1\u2013160:28 (2018). https:\/\/doi.org\/10.1145\/3276530","journal-title":"PACMPL"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Perrin, M., Mostefaoui, A., Jard, C.: Causal consistency: beyond memory. In: Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2016, pp. 26:1\u201326:12. ACM, New York (2016)","DOI":"10.1145\/2851141.2851170"},{"key":"18_CR23","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: Proceedings of the Fifteenth ACM Symposium on Operating System Principles, SOSP 1995, Copper Mountain Resort, Colorado, USA, December 3\u20136, 1995, pp. 172\u2013183 (1995). https:\/\/doi.org\/10.1145\/224056.224070","DOI":"10.1145\/224056.224070"},{"key":"18_CR24","doi-asserted-by":"publisher","unstructured":"Wolper, P.: Expressing interesting properties of programs in propositional temporal logic. In: Conference Record of the Thirteenth Annual ACM Symposium on Principles of Programming Languages, St. Petersburg Beach, Florida, USA, January 1986, pp. 184\u2013193 (1986). https:\/\/doi.org\/10.1145\/512644.512661","DOI":"10.1145\/512644.512661"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39322-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:43:35Z","timestamp":1710269015000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-39322-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030393212","9783030393229"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39322-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"13 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VMCAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Verification, Model Checking, and Abstract Interpretation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Orleans, LA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 January 2020","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":"vmcai2020a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/popl20.sigplan.org\/home\/VMCAI-2020","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":"44","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":"0","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":"48% - 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":"4,4","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)"}}]}}