{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T00:18:40Z","timestamp":1769041120926,"version":"3.49.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031199912","type":"print"},{"value":"9783031199929","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-19992-9_6","type":"book-chapter","created":{"date-parts":[[2022,10,22]],"date-time":"2022-10-22T09:12:06Z","timestamp":1666429926000},"page":"83-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fence Synthesis Under the\u00a0C11 Memory Model"],"prefix":"10.1007","author":[{"given":"Sanjana","family":"Singh","sequence":"first","affiliation":[]},{"given":"Divyanjali","family":"Sharma","sequence":"additional","affiliation":[]},{"given":"Ishita","family":"Jaju","sequence":"additional","affiliation":[]},{"given":"Subodh","family":"Sharma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,21]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Arora, J., Atig, M.F., Krishna, S.: Verification of programs under the release-acquire semantics. In: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 1117\u20131132 (2019)","DOI":"10.1145\/3314221.3314649"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-642-33125-1_13","volume-title":"Static Analysis","author":"PA Abdulla","year":"2012","unstructured":"Abdulla, P.A., Atig, M.F., Chen, Y.-F., Leonardsson, C., Rezine, A.: Automatic fence insertion in integer programs via predicate abstraction. In: Min\u00e9, A., Schmidt, D. (eds.) SAS 2012. LNCS, vol. 7460, pp. 164\u2013180. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33125-1_13"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Atig, M.F., Jonsson, B., Ngo, T.P.: Optimal stateless model checking under the release-acquire semantics. Proc. ACM Program. Lang. 2(OOPSLA), 1\u201329 (2018)","DOI":"10.1145\/3276505"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-319-26850-7_3","volume-title":"Networked Systems","author":"PA Abdulla","year":"2015","unstructured":"Abdulla, P.A., Atig, M.F., L\u00e5ng, M., Ngo, T.P.: Precise and sound automatic fence insertion procedure under PSO. In: Bouajjani, A., Fauconnier, H. (eds.) NETYS 2015. LNCS, vol. 9466, pp. 32\u201347. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26850-7_3"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-662-46669-8_13","volume-title":"Programming Languages and Systems","author":"PA Abdulla","year":"2015","unstructured":"Abdulla, P.A., Atig, M.F., Ngo, T.-P.: The best of both worlds: trading efficiency and optimality in fence insertion for TSO. In: Vitek, J. (ed.) ESOP 2015. LNCS, vol. 9032, pp. 308\u2013332. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46669-8_13"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/978-3-319-08867-9_33","volume-title":"Computer Aided Verification","author":"J Alglave","year":"2014","unstructured":"Alglave, J., Kroening, D., Nimal, V., Poetzl, D.: Don\u2019t sit on the fence. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 508\u2013524. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_33"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-642-14295-6_25","volume-title":"Computer Aided Verification","author":"J Alglave","year":"2010","unstructured":"Alglave, J., Maranget, L., Sarkar, S., Sewell, P.: Fences in weak memory models. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 258\u2013272. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14295-6_25"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.artint.2014.02.003","volume":"210","author":"F Angiulli","year":"2014","unstructured":"Angiulli, F., Ben-Eliyahu-Zohary, R., Fassetti, F., Palopoli, L.: On the tractability of minimal model computation for some CNF theories. Artif. Intell. 210, 56\u201377 (2014)","journal-title":"Artif. Intell."},{"issue":"1","key":"6_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1145\/1925844.1926394","volume":"46","author":"M Batty","year":"2011","unstructured":"Batty, M., Owens, S., Sarkar, S., Sewell, P., Weber, T.: Mathematizing c++ concurrency. ACM SIGPLAN Notices 46(1), 55\u201366 (2011)","journal-title":"ACM SIGPLAN Notices"},{"issue":"10","key":"6_CR10","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1145\/2858965.2814318","volume":"50","author":"J Bender","year":"2015","unstructured":"Bender, J., Lesani, M., Palsberg, J.: Declarative fence insertion. ACM SIGPLAN Notices 50(10), 367\u2013385 (2015)","journal-title":"ACM SIGPLAN Notices"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Fang, X., Lee, J., Midkiff, S.P.: Automatic fence insertion for shared memory multiprocessing. In: Proceedings of the 17th Annual International Conference on Supercomputing, pp. 285\u2013294 (2003)","DOI":"10.1145\/782814.782854"},{"key":"6_CR12","unstructured":"ISO\/IEC-JTC1\/SC22\/WG21: Programming languages - C++ (2013). http:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2013\/n3690.pdf"},{"issue":"1","key":"6_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0204007","volume":"4","author":"DB Johnson","year":"1975","unstructured":"Johnson, D.B.: Finding all the elementary circuits of a directed graph. SIAM J. Comput. 4(1), 77\u201384 (1975)","journal-title":"SIAM J. Comput."},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-319-19249-9_19","volume-title":"FM 2015: Formal Methods","author":"S Joshi","year":"2015","unstructured":"Joshi, S., Kroening, D.: Property-driven fence insertion using reorder bounded model checking. In: Bj\u00f8rner, N., de Boer, F. (eds.) FM 2015. LNCS, vol. 9109, pp. 291\u2013307. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19249-9_19"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Kokologiannakis, M., Raad, A., Vafeiadis, V.: Model checking for weakly consistent libraries. In: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 96\u2013110 (2019)","DOI":"10.1145\/3314221.3314609"},{"issue":"2","key":"6_CR16","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1145\/2261417.2261438","volume":"43","author":"M Kuperstein","year":"2012","unstructured":"Kuperstein, M., Vechev, M., Yahav, E.: Automatic inference of memory fences. ACM SIGACT News 43(2), 108\u2013123 (2012)","journal-title":"ACM SIGACT News"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Lahav, O., Vafeiadis, V., Kang, J., Hur, C.K., Dreyer, D.: Repairing sequential consistency in c\/c++ 11, vol. 52, pp. 618\u2013632. ACM New York, NY (2017)","DOI":"10.1145\/3140587.3062352"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-642-36742-7_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Linden","year":"2013","unstructured":"Linden, A., Wolper, P.: A verification-based approach to memory fence insertion in PSO memory systems. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 339\u2013353. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36742-7_24"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-319-10936-7_15","volume-title":"Static Analysis","author":"Y Meshman","year":"2014","unstructured":"Meshman, Y., Dan, A., Vechev, M., Yahav, E.: Synthesis of memory fences via refinement propagation. In: M\u00fcller-Olm, M., Seidl, H. (eds.) SAS 2014. LNCS, vol. 8723, pp. 237\u2013252. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10936-7_15"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Norris, B., Demsky, B.: CDSchecker: checking concurrent data structures written with C\/C++ atomics. In: Proceedings of the 2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages & Applications, pp. 131\u2013150 (2013)","DOI":"10.1145\/2509136.2509514"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Oberhauser, J., et al.: VSync: push-button verification and optimization for synchronization primitives on weak memory models. In: Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 530\u2013545 (2021)","DOI":"10.1145\/3445814.3446748"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Singh, S., Sharma, D., Jaju, I., Sharma, S.: Fence synthesis under the c11 memory model. arXiv preprint arXiv:2208.00285 (2022)","DOI":"10.1007\/978-3-031-19992-9_6"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Singh, S., Sharma, D., Sharma, S.: Dynamic verification of c11 concurrency over multi copy atomics. In: 2021 International Symposium on Theoretical Aspects of Software Engineering (TASE), pp. 39\u201346. IEEE (2021)","DOI":"10.1109\/TASE52547.2021.00023"},{"key":"6_CR24","unstructured":"Taheri, M., Pourdamghani, A., Lesani, M.: Polynomial-time fence insertion for structured programs. In: 33rd International Symposium on Distributed Computing (DISC 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Vafeiadis, V., Balabonski, T., Chakraborty, S., Morisset, R., Zappa Nardelli, F.: Common compiler optimisations are invalid in the c11 memory model and what we can do about it. In: Proceedings of the 42Nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 209\u2013220 (2015)","DOI":"10.1145\/2676726.2676995"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-19992-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,9]],"date-time":"2023-03-09T14:54:57Z","timestamp":1678373697000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19992-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031199912","9783031199929"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19992-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"21 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ATVA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Automated Technology for Verification and Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"atva2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/atva-conference.org\/2022\/","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":"81","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":"5","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":"26% - 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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the COVID-19 pandemic, the conference was held virtually. Additional to the 26 papers, 1 invited talk is 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)"}}]}}