{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:30:59Z","timestamp":1742952659100,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030670863"},{"type":"electronic","value":"9783030670870"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-67087-0_17","type":"book-chapter","created":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T01:17:39Z","timestamp":1610587059000},"page":"261-278","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Verifying Weakly Consistent Transactional Programs Using Symbolic Execution"],"prefix":"10.1007","author":[{"given":"Burcu Kulahcioglu","family":"Ozkan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,14]]},"reference":[{"issue":"1","key":"17_CR1","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. Distributed Comput. 9(1), 37\u201349 (1995)","journal-title":"Distributed Comput."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Balegas, V., et al.: Putting consistency back into eventual consistency. In: The 10th European Conference on Computer Systems, EuroSys, pp. 6:1\u20136:16. ACM (2015)","DOI":"10.1145\/2741948.2741972"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/11804192_17","volume-title":"Formal Methods for Components and Objects","author":"M Barnett","year":"2006","unstructured":"Barnett, M., Chang, B.-Y.E., DeLine, R., Jacobs, B., Leino, K.R.M.: Boogie: a modular reusable verifier for object-oriented programs. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2005. LNCS, vol. 4111, pp. 364\u2013387. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11804192_17"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-030-25543-5_17","volume-title":"Computer Aided Verification","author":"SM Beillahi","year":"2019","unstructured":"Beillahi, S.M., Bouajjani, A., Enea, C.: Checking robustness against snapshot isolation. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11562, pp. 286\u2013304. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25543-5_17"},{"key":"17_CR5","unstructured":"Beillahi, S.M., Bouajjani, A., Enea, C.: Robustness against transactional causal consistency. In: 30th International Conference on Concurrency Theory, CONCUR. LIPIcs, vol. 140, pp. 30:1\u201330:18 (2019)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Berenson, H., Bernstein, P.A., Gray, J., Melton, J., O\u2019Neil, E.J., O\u2019Neil, P.E.: A critique of ANSI SQL isolation levels. In: ACM SIGMOD International Conference on Management of Data, pp. 1\u201310. ACM Press (1995)","DOI":"10.1145\/568271.223785"},{"key":"17_CR7","unstructured":"Bernardi, G., Gotsman, A.: Robustness against consistency models with atomic visibility. In: 27th International Conference on Concurrency Theory, CONCUR. LIPIcs, vol. 59, pp. 7:1\u20137:15 (2016)"},{"key":"17_CR8","unstructured":"Bernstein, P.A., Hadzilacos, V., Goodman, N.: Concurrency Control and Recovery in Database Systems. Addison-Wesley (1987)"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Brewer, E.A.: Towards robust distributed systems (abstract). In: The 9th Annual ACM Symposium on Principles of Distributed Computing, p. 7. ACM (2000)","DOI":"10.1145\/343477.343502"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Brutschy, L., Dimitrov, D., M\u00fcller, P., Vechev, M.T.: Serializability for eventual consistency: criterion, analysis, and applications. In: The 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL, pp. 458\u2013472. ACM (2017)","DOI":"10.1145\/3009837.3009895"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Brutschy, L., Dimitrov, D., M\u00fcller, P., Vechev, M.T.: Static serializability analysis for causal consistency. In: The 39th ACM SIGPLAN Conf. on Programming Language Design and Implementation, PLD, pp. 90\u2013104. ACM (2018)","DOI":"10.1145\/3192366.3192415"},{"issue":"1\u20132","key":"17_CR12","first-page":"1","volume":"1","author":"S Burckhardt","year":"2014","unstructured":"Burckhardt, S.: Principles of eventual consistency. Found. Trends Program. Lang. 1(1\u20132), 1\u2013150 (2014)","journal-title":"Found. Trends Program. Lang."},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Burckhardt, 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, pp. 271\u2013284. ACM (2014)","DOI":"10.1145\/2535838.2535848"},{"key":"17_CR14","unstructured":"Burckhardt, S., Leijen, D., Protzenko, J., F\u00e4hndrich, M.: Global sequence protocol: a robust abstraction for replicated shared state. In: 29th European Conference on Object-Oriented Programming, ECOOP, LIPIcs, vol. 37, pp. 568\u2013590 (2015)"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Cahill, M.J., R\u00f6hm, U., Fekete, A.D.: Serializable isolation for snapshot databases. ACM Trans. Database Syst. 34(4), 20:1\u201320:42 (2009)","DOI":"10.1145\/1620585.1620587"},{"key":"17_CR16","unstructured":"Cerone, A., Bernardi, G., Gotsman, A.: A framework for transactional consistency models with atomic visibility. In: 26th International Conference on Concurrency Theory, CONCUR. LIPIcs, vol. 42, pp. 58\u201371 (2015)"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Cerone, A., Gotsman, A.: Analysing snapshot isolation. J. ACM 65(2), 11:1\u201311:41 (2018)","DOI":"10.1145\/3152396"},{"issue":"4","key":"17_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3149485.3149493","volume":"42","author":"M Dabaghchian","year":"2017","unstructured":"Dabaghchian, M., Rakamaric, Z., Kulahcioglu Ozkan, B., Mutlu, E., Tasiran, S.: Consistency-aware scheduling for weakly consistent programs. ACM SIGSOFT Softw. Eng. Notes 42(4), 1\u20135 (2017)","journal-title":"ACM SIGSOFT Softw. Eng. Notes"},{"issue":"2","key":"17_CR19","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1145\/1071610.1071615","volume":"30","author":"A Fekete","year":"2005","unstructured":"Fekete, A., Liarokapis, D., O\u2019Neil, E.J., O\u2019Neil, P.E., Shasha, D.E.: Making snapshot isolation serializable. ACM Trans. Database Syst. 30(2), 492\u2013528 (2005)","journal-title":"ACM Trans. Database Syst."},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Gotsman, A., Yang, H., Ferreira, C., Najafzadeh, M., Shapiro, M.: \u2019cause i\u2019m strong enough: reasoning about consistency choices in distributed systems. In: The 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL, pp. 371\u2013384. ACM (2016)","DOI":"10.1145\/2837614.2837625"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Holt, B., Bornholt, J., Zhang, I., Ports, D.R.K., Oskin, M., Ceze, L.: Disciplined inconsistency with consistency types. In: The 7th ACM Symposium on Cloud Computing, pp. 279\u2013293. ACM (2016)","DOI":"10.1145\/2987550.2987559"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Kaki, G., Nagar, K., Najafzadeh, M., Jagannathan, S.: Alone together: compositional reasoning and inference for weak isolation. In: Proceedings ACM Programming Language, vol. 2(POPL), pp. 27:1\u201327:34 (2018)","DOI":"10.1145\/3158115"},{"key":"17_CR23","unstructured":"Kuru, I., Kulahcioglu Ozkan, B., Mutluergil, S.O., Tasiran, S., Elmas, T., Cohen, E.: Verifying programs under snapshot isolation and similar relaxed consistency models. In: The 9th ACM SIGPLAN Workshop on Transactional Computing (2014)"},{"issue":"2","key":"17_CR24","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/1773912.1773922","volume":"44","author":"A Lakshman","year":"2010","unstructured":"Lakshman, A., Malik, P.: Cassandra: a decentralized structured storage system. Operating Syst. Rev. 44(2), 35\u201340 (2010)","journal-title":"Operating Syst. Rev."},{"issue":"7","key":"17_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)","journal-title":"Commun. ACM"},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"Liew, D., Cadar, C., Donaldson, A.F.: Symbooglix: a symbolic execution engine for boogie programs. In: 2016 IEEE International Conference on Software Testing, Verification and Validation, ICST, pp. 45\u201356. IEEE Computer Society (2016)","DOI":"10.1109\/ICST.2016.11"},{"key":"17_CR27","doi-asserted-by":"crossref","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: The 23rd ACM Symposium on Operating Systems Principles 2011, SOSP, pp. 401\u2013416. ACM (2011)","DOI":"10.1145\/2043556.2043593"},{"key":"17_CR28","unstructured":"Nagar, K., Jagannathan, S.: Automated detection of serializability violations under weak consistency. In: 29th International Conference on Concurrency Theory, CONCUR. LIPIcs, vol. 118, pp. 41:1\u201341:18 (2018)"},{"key":"17_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/978-3-030-44914-8_20","volume-title":"Programming Languages and Systems","author":"SS Nair","year":"2020","unstructured":"Nair, S.S., Petri, G., Shapiro, M.: Proving the safety of highly-available distributed objects. ESOP 2020. LNCS, vol. 12075, pp. 544\u2013571. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44914-8_20"},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Najafzadeh, M., Gotsman, A., Yang, H., Ferreira, C., Shapiro, M.: The CISE tool: proving weakly-consistent applications correct. In: The 2nd Workshop on the Principles and Practice of Consistency for Distributed Data, pp. 2:1\u20132:3. ACM (2016)","DOI":"10.1145\/2911151.2911160"},{"key":"17_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-642-24550-3_29","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"M Shapiro","year":"2011","unstructured":"Shapiro, M., Pregui\u00e7a, N., Baquero, C., Zawirski, M.: Conflict-free replicated data types. In: D\u00e9fago, X., Petit, F., Villain, V. (eds.) SSS 2011. LNCS, vol. 6976, pp. 386\u2013400. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24550-3_29"},{"key":"17_CR32","doi-asserted-by":"crossref","unstructured":"Sovran, Y., Power, R., Aguilera, M.K., Li, J.: Transactional storage for geo-replicated systems. In: The 23rd ACM Symposium on Operating System Principles 2011, SOSP, pp. 385\u2013400. ACM (2011)","DOI":"10.1145\/2043556.2043592"},{"key":"17_CR33","doi-asserted-by":"crossref","unstructured":"Zellag, K., Kemme, B.: How consistent is your cloud application? In: ACM Symposium on Cloud Computing, SOCC, p. 6 (2012)","DOI":"10.1145\/2391229.2391235"},{"key":"17_CR34","doi-asserted-by":"crossref","unstructured":"Zeller, P.: Testing properties of weakly consistent programs with repliss. In: The 3rd International Workshop on Principles and Practice of Consistency for Distributed Data. pp. 3:1\u20133:5 (2017)","DOI":"10.1145\/3064889.3064893"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67087-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T01:50:13Z","timestamp":1610589013000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-67087-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030670863","9783030670870"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67087-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"14 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NETYS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Networked Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marrakech","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","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":"3 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/netys.net\/","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":"46","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":"18","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":"4","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.75","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)"}},{"value":"The conference was held virtually. Three invited papers are also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}