{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T16:11:49Z","timestamp":1781885509950,"version":"3.54.5"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031223075","type":"print"},{"value":"9783031223082","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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22308-2_7","type":"book-chapter","created":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T19:55:03Z","timestamp":1669924503000},"page":"135-159","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Automated Synthesis of\u00a0Asynchronizations"],"prefix":"10.1007","author":[{"given":"Sidi Mohamed","family":"Beillahi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ahmed","family":"Bouajjani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Constantin","family":"Enea","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuvendu","family":"Lahiri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,12,2]]},"reference":[{"issue":"4","key":"7_CR1","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/197405.197406","volume":"26","author":"DF Bacon","year":"1994","unstructured":"Bacon, D.F., Graham, S.L., Sharp, O.J.: Compiler transformations for high-performance computing. ACM Comput. Surv. 26(4), 345\u2013420 (1994). https:\/\/doi.org\/10.1145\/197405.197406","journal-title":"ACM Comput. Surv."},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Beillahi, S.M., Bouajjani, A., Enea, C., Lahiri, S.: Artifact for the SAS 2022 paper: Automated Synthesis of Asynchronizations (May 2022). DOI: https:\/\/doi.org\/10.5281\/zenodo.7055422,https:\/\/doi.org\/10.5281\/zenodo.7055422","DOI":"10.5281\/zenodo.7055422,"},{"key":"7_CR3","unstructured":"Beillahi, S.M., Bouajjani, A., Enea, C., Lahiri, S.: Automated synthesis of asynchronizations. CoRR abs\/2209.06648 (2022), https:\/\/arxiv.org\/abs\/2209.06648"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-642-31057-7_12","volume-title":"ECOOP 2012 \u2013 Object-Oriented Programming","author":"G Bierman","year":"2012","unstructured":"Bierman, G., Russo, C., Mainland, G., Meijer, E., Torgersen, M.: Pause n play: formalizing asynchronous C$$^\\sharp $$. In: Noble, J. (ed.) ECOOP 2012. LNCS, vol. 7313, pp. 233\u2013257. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31057-7_12"},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Blackshear, S., Gorogiannis, N., O\u2019Hearn, P.W., Sergey, I.: Racerd: compositional static race detection. Proc. ACM Program. Lang. 2(OOPSLA), 144:1\u2013144:28 (2018). https:\/\/doi.org\/10.1145\/3276514","DOI":"10.1145\/3276514"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Bloem, R., Hofferek, G., K\u00f6nighofer, B., K\u00f6nighofer, R., Ausserlechner, S., Spork, R.: Synthesis of synchronization using uninterpreted functions. In: Formal Methods in Computer-Aided Design, FMCAD 2014, Lausanne, Switzerland, 21\u201324 October 2014. pp. 35\u201342. IEEE (2014). https:\/\/doi.org\/10.1109\/FMCAD.2014.6987593","DOI":"10.1109\/FMCAD.2014.6987593"},{"issue":"12","key":"7_CR7","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/2.546612","volume":"29","author":"W Blume","year":"1996","unstructured":"Blume, W., et al.: Parallel programming with Polaris. Computer 29(12), 81\u201387 (1996). https:\/\/doi.org\/10.1109\/2.546612","journal-title":"Computer"},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Bouajjani, A., Emmi, M.: Analysis of recursively parallel programs. In: Field, J., Hicks, M. (eds.) Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2012, Philadelphia, Pennsylvania, USA, 22\u201328 January 2012, pp. 203\u2013214. ACM (2012). https:\/\/doi.org\/10.1145\/2103656.2103681","DOI":"10.1145\/2103656.2103681"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-662-54434-1_7","volume-title":"Programming Languages and Systems","author":"A Bouajjani","year":"2017","unstructured":"Bouajjani, A., Emmi, M., Enea, C., Ozkan, B.K., Tasiran, S.: Verifying robustness of event-driven asynchronous programs against concurrency. In: Yang, H. (ed.) ESOP 2017. LNCS, vol. 10201, pp. 170\u2013200. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54434-1_7"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-319-21668-3_11","volume-title":"Computer Aided Verification","author":"P \u010cern\u00fd","year":"2015","unstructured":"\u010cern\u00fd, P., Clarke, E.M., Henzinger, T.A., Radhakrishna, A., Ryzhyk, L., Samanta, R., Tarrach, T.: From Non-preemptive to preemptive scheduling using synchronization synthesis. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9207, pp. 180\u2013197. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21668-3_11"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/978-3-319-08867-9_38","volume-title":"Computer Aided Verification","author":"P \u010cern\u00fd","year":"2014","unstructured":"\u010cern\u00fd, P., Henzinger, T.A., Radhakrishna, A., Ryzhyk, L., Tarrach, T.: Regression-free synthesis for concurrency. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 568\u2013584. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_38"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0025774","volume-title":"Logics of Programs","author":"EM Clarke","year":"1982","unstructured":"Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 52\u201371. Springer, Heidelberg (1982). https:\/\/doi.org\/10.1007\/BFb0025774"},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"Engler, D.R., Ashcraft, K.: Racerx: effective, static detection of race conditions and deadlocks. In: Scott, M.L., Peterson, L.L. (eds.) Proceedings of the 19th ACM Symposium on Operating Systems Principles 2003, SOSP 2003, Bolton Landing, NY, USA, 19\u201322 October 2003, pp. 237\u2013252. ACM (2003). https:\/\/doi.org\/10.1145\/945445.945468","DOI":"10.1145\/945445.945468"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Flanagan, C., Freund, S.N.: Fasttrack: efficient and precise dynamic race detection. In: Hind, M., Diwan, A. (eds.) Proceedings of the 2009 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2009, Dublin, Ireland, 15\u201321 June 2009, pp. 121\u2013133. ACM (2009). https:\/\/doi.org\/10.1145\/1542476.1542490","DOI":"10.1145\/1542476.1542490"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Ganty, P., Majumdar, R.: Algorithmic verification of asynchronous programs. ACM Trans. Program. Lang. Syst. 34(1), 6:1\u20136:48 (2012). https:\/\/doi.org\/10.1145\/2160910.2160915","DOI":"10.1145\/2160910.2160915"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-642-36742-7_16","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"P Godefroid","year":"2013","unstructured":"Godefroid, P., Yannakakis, M.: Analysis of Boolean programs. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 214\u2013229. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36742-7_16"},{"key":"7_CR17","doi-asserted-by":"publisher","unstructured":"Gokhale, S., Turcotte, A., Tip, F.: Automatic migration from synchronous to asynchronous javascript apis. Proc. ACM Program. Lang. 5(OOPSLA), 1\u201327 (2021). https:\/\/doi.org\/10.1145\/3485537","DOI":"10.1145\/3485537"},{"key":"7_CR18","doi-asserted-by":"publisher","unstructured":"Gupta, A., Henzinger, T.A., Radhakrishna, A., Samanta, R., Tarrach, T.: Succinct representation of concurrent trace sets. In: Rajamani, S.K., Walker, D. (eds.) Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2015, Mumbai, India, 15\u201317 January 2015, pp. 433\u2013444. ACM (2015). https:\/\/doi.org\/10.1145\/2676726.2677008","DOI":"10.1145\/2676726.2677008"},{"key":"7_CR19","doi-asserted-by":"publisher","unstructured":"Han, H., Tseng, C.: A comparison of parallelization techniques for irregular reductions. In: Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), San Francisco, CA, USA, 23\u201327 April 2001, p. 27. IEEE Computer Society (2001). https:\/\/doi.org\/10.1109\/IPDPS.2001.924963","DOI":"10.1109\/IPDPS.2001.924963"},{"key":"7_CR20","doi-asserted-by":"publisher","unstructured":"Kini, D., Mathur, U., Viswanathan, M.: Dynamic race prediction in linear time. In: Cohen, A., Vechev, M.T. (eds.) Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2017, Barcelona, Spain, 18\u201323 June 2017, pp. 157\u2013170. ACM (2017). https:\/\/doi.org\/10.1145\/3062341.3062374","DOI":"10.1145\/3062341.3062374"},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"Li, G., Lu, S., Musuvathi, M., Nath, S., Padhye, R.: Efficient scalable thread-safety-violation detection: finding thousands of concurrency bugs during testing. In: Brecht, T., Williamson, C. (eds.) Proceedings of the 27th ACM Symposium on Operating Systems Principles, SOSP 2019, Huntsville, ON, Canada, 27\u201330 October 2019. pp. 162\u2013180. ACM (2019). https:\/\/doi.org\/10.1145\/3341301.3359638","DOI":"10.1145\/3341301.3359638"},{"key":"7_CR22","doi-asserted-by":"publisher","unstructured":"Lin, Y., Okur, S., Dig, D.: Study and refactoring of android asynchronous programming (T). In: Cohen, M.B., Grunske, L., Whalen, M. (eds.) 30th IEEE\/ACM International Conference on Automated Software Engineering, ASE 2015, Lincoln, NE, USA, 9\u201313 November 2015, pp. 224\u2013235. IEEE Computer Society (2015). https:\/\/doi.org\/10.1109\/ASE.2015.50","DOI":"10.1109\/ASE.2015.50"},{"key":"7_CR23","doi-asserted-by":"publisher","unstructured":"Liu, B., Huang, J.: D4: fast concurrency debugging with parallel differential analysis. In: Foster, J.S., Grossman, D. (eds.) Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2018, Philadelphia, PA, USA, 18\u201322 June 2018, pp. 359\u2013373. ACM (2018). https:\/\/doi.org\/10.1145\/3192366.3192390","DOI":"10.1145\/3192366.3192390"},{"issue":"1","key":"7_CR24","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/357233.357237","volume":"6","author":"Z Manna","year":"1984","unstructured":"Manna, Z., Wolper, P.: Synthesis of communicating processes from temporal logic specifications. ACM Trans. Program. Lang. Syst. 6(1), 68\u201393 (1984). https:\/\/doi.org\/10.1145\/357233.357237","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"7_CR25","doi-asserted-by":"publisher","unstructured":"Okur, S., Hartveld, D.L., Dig, D., van Deursen, A.: A study and toolkit for asynchronous programming in c#. In: Jalote, P., Briand, L.C., van der Hoek, A. (eds.) 36th International Conference on Software Engineering, ICSE 2014, Hyderabad, India - May 31\u2013June 07, 2014, pp. 1117\u20131127. ACM (2014). https:\/\/doi.org\/10.1145\/2568225.2568309","DOI":"10.1145\/2568225.2568309"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-642-16612-9_28","volume-title":"Runtime Verification","author":"R Raman","year":"2010","unstructured":"Raman, R., Zhao, J., Sarkar, V., Vechev, M., Yahav, E.: Efficient data race detection for Async-finish parallelism. In: Barringer, H., et al. (eds.) RV 2010. LNCS, vol. 6418, pp. 368\u2013383. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16612-9_28"},{"key":"7_CR27","unstructured":"Roslyn: (2022). https:\/\/github.com\/dotnet\/roslyn"},{"key":"7_CR28","doi-asserted-by":"publisher","unstructured":"Santhiar, A., Kanade, A.: Static deadlock detection for asynchronous c# programs. In: Cohen, A., Vechev, M.T. (eds.) Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2017, Barcelona, Spain, 18\u201323 June 2017, pp. 292\u2013305. ACM (2017). https:\/\/doi.org\/10.1145\/3062341.3062361","DOI":"10.1145\/3062341.3062361"},{"key":"7_CR29","doi-asserted-by":"publisher","unstructured":"Smaragdakis, Y., Evans, J., Sadowski, C., Yi, J., Flanagan, C.: Sound predictive race detection in polynomial time. In: Field, J., Hicks, M. (eds.) Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2012, Philadelphia, Pennsylvania, USA, 22\u201328 January 2012, pp. 387\u2013400. ACM (2012). https:\/\/doi.org\/10.1145\/2103656.2103702","DOI":"10.1145\/2103656.2103702"},{"key":"7_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-642-00768-2_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Vechev","year":"2009","unstructured":"Vechev, M., Yahav, E., Yorsh, G.: Inferring synchronization under limited observability. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505, pp. 139\u2013154. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00768-2_13"},{"key":"7_CR31","doi-asserted-by":"publisher","unstructured":"Vechev, M.T., Yahav, E., Yorsh, G.: Abstraction-guided synthesis of synchronization. In: Hermenegildo, M.V., Palsberg, J. (eds.) Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2010, Madrid, Spain, 17\u201323 January 2010, pp. 327\u2013338. ACM (2010). https:\/\/doi.org\/10.1145\/1706299.1706338","DOI":"10.1145\/1706299.1706338"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22308-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T19:55:57Z","timestamp":1669924557000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22308-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031223075","9783031223082"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22308-2_7","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":"2 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Static Analysis Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Auckland","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Zealand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sas2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.staticanalysis.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"43","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":"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":"42% - 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.2","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":"6.1","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)"}}]}}