{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T21:40:01Z","timestamp":1750628401528,"version":"3.41.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319624068"},{"type":"electronic","value":"9783319624075"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-62407-5_16","type":"book-chapter","created":{"date-parts":[[2017,7,14]],"date-time":"2017-07-14T11:16:58Z","timestamp":1500031018000},"page":"233-245","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Posting Graphs for Finding Non-Terminating Executions in Asynchronous Programs"],"prefix":"10.1007","author":[{"given":"Mohamed A.","family":"El-Zawawy","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,15]]},"reference":[{"key":"16_CR1","first-page":"244","volume":"25","author":"T Abe","year":"2017","unstructured":"Abe, T., Maeda, T.: Concurrent program logic for relaxed memory consistency models with dependencies across loop iterations. J. Inf. Process. 25, 244\u2013255 (2017)","journal-title":"J. Inf. Process."},{"key":"16_CR2","volume-title":"Concurrent Programming: Principles and Practice","author":"GR Andrews","year":"1991","unstructured":"Andrews, G.R.: Concurrent Programming: Principles and Practice. Benjamin\/Cummings Publishing Company, San Francisco (1991)"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Brotherston, J., Bornat, R., Calcagno C.: Cyclic proofs of program termination in separation logic. In: ACM SIGPLAN Notices, vol. 43, pp. 101\u2013112. ACM (2008)","DOI":"10.1145\/1328897.1328453"},{"key":"16_CR4","volume-title":"Node. js in Action","author":"M Cantelon","year":"2014","unstructured":"Cantelon, M., Harter, M., Holowaychuk, T.J., Rajlich, N.: Node. js in Action. Manning, Greenwich (2014)"},{"issue":"3","key":"16_CR5","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1145\/2872887.2750373","volume":"43","author":"G Chadha","year":"2016","unstructured":"Chadha, G., Mahlke, S., Narayanasamy, S.: Accelerating asynchronous programs through event sneak peek. ACM SIGARCH Comput. Archit. News 43(3), 642\u2013654 (2016)","journal-title":"ACM SIGARCH Comput. Archit. News"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/3-540-45657-0_36","volume-title":"International Conference on Computer Aided Verification","author":"MA Col\u00f3n","year":"2002","unstructured":"Col\u00f3n, M.A., Sipma, H.B.: Practical methods for proving program termination. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 442\u2013454. Springer, Heidelberg (2002). doi:10.1007\/3-540-45657-0_36"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Cook, B., Podelski, A., Rybalchenko, A.: Termination proofs for systems code. In: ACM SIGPLAN Notices, vol. 41, pp. 415\u2013426. ACM (2006)","DOI":"10.1145\/1133255.1134029"},{"issue":"5","key":"16_CR8","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1145\/1941487.1941509","volume":"54","author":"B Cook","year":"2011","unstructured":"Cook, B., Podelski, A., Rybalchenko, A.: Proving program termination. Commun. ACM 54(5), 88\u201398 (2011)","journal-title":"Commun. ACM"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30579-8_1","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"P Cousot","year":"2005","unstructured":"Cousot, P.: Proving program invariance and termination by parametric abstraction, Lagrangian relaxation and semidefinite programming. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 1\u201324. Springer, Heidelberg (2005). doi:10.1007\/978-3-540-30579-8_1"},{"issue":"4","key":"16_CR10","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1145\/227210.227231","volume":"39","author":"F Cristian","year":"1996","unstructured":"Cristian, F.: Synchronous and asynchronous. Commun. ACM 39(4), 88\u201397 (1996)","journal-title":"Commun. ACM"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1007\/978-3-642-39640-3_38","volume-title":"International Conference on Computational Science and Its Applications","author":"MA El-Zawawy","year":"2013","unstructured":"El-Zawawy, M.A.: Detection of probabilistic dangling references in multi-core programs using proof-supported tools. In: Murgante, B., et al. (eds.) ICCSA 2013. LNCS, vol. 7975, pp. 516\u2013530. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-39640-3_38"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"El-Zawawy, M.A.: An efficient layer-aware technique for developing asynchronous context-oriented software (acos). In: 2015 15th International Conference on Computational Science and Its Applications (ICCSA), pp. 14\u201320. IEEE (2015)","DOI":"10.1109\/ICCSA.2015.9"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-319-42092-9_32","volume-title":"International Conference on Computational Science and Its Applications","author":"MA ElZawawy","year":"2016","unstructured":"ElZawawy, M.A.: Finding divergent executions in asynchronous programs. In: Gervasi, O., et al. (eds.) International Conference on Computational Science and Its Applications. LNCS, vol. 9790, pp. 410\u2013421. Springer, Heidelberg (2016). doi:10.1007\/978-3-319-42092-9_32"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"El-Zawawy, M.A., Alanazi, M.N.: An efficient binary technique for trace simplifications of concurrent programs. In: 2014 IEEE 6th International Conference on Adaptive Science & Technology (ICAST), pp. 1\u20138. IEEE (2014)","DOI":"10.1109\/ICASTECH.2014.7068106"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/978-3-642-33125-1_29","volume-title":"Static Analysis","author":"M Emmi","year":"2012","unstructured":"Emmi, M., Lal, A.: Finding non-terminating executions in distributed asynchronous programs. In: Min\u00e9, A., Schmidt, D. (eds.) SAS 2012. LNCS, vol. 7460, pp. 439\u2013455. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-33125-1_29"},{"issue":"1","key":"16_CR16","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/2160910.2160915","volume":"34","author":"P Ganty","year":"2012","unstructured":"Ganty, P., Majumdar, R.: Algorithmic verification of asynchronous programs. ACM Trans. Program. Lang. Syst. (TOPLAS) 34(1), 6 (2012)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Jhala, R., Majumdar, R.: Interprocedural analysis of asynchronous programs. In: ACM SIGPLAN Notices, vol. 42, pp. 339\u2013350. ACM (2007)","DOI":"10.1145\/1190215.1190266"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Lucia, B., Ceze, L.: Cooperative empirical failure avoidance for multithreaded programs. In: ACM SIGPLAN Notices, vol. 48, pp. 39\u201350. ACM (2013)","DOI":"10.1145\/2499368.2451121"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Musuvathi, M., Qadeer, S.: Iterative context bounding for systematic testing of multithreaded programs. In: ACM SIGPLAN Notices, vol. 42, pp. 446\u2013455. ACM (2007)","DOI":"10.1145\/1273442.1250785"},{"key":"16_CR20","unstructured":"Musuvathi, M., Qadeer, S., Ball, T., Basler, G., Nainar, P.A., Neamtiu, I.: Finding and reproducing Heisenbugs in concurrent programs. In: OSDI, vol. 8, pp. 267\u2013280 (2008)"},{"key":"16_CR21","unstructured":"Ousterhout, J.: Why threads are a bad idea (for most purposes). In: Presentation Given at the 1996 Usenix Annual Technical Conference, vol. 5, San Diego, CA, USA (1996)"},{"key":"16_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/BFb0035790","volume-title":"International Colloquium on Automata, Languages, and Programming","author":"A Pnueli","year":"1989","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of an asynchronous reactive module. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds.) ICALP 1989. LNCS, vol. 372, pp. 652\u2013671. Springer, Heidelberg (1989). doi:10.1007\/BFb0035790"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Sabelfeld, A., Sands, D.: Probabilistic noninterference for multi-threaded programs. In: Proceedings of 13th IEEE Computer Security Foundations Workshop, CSFW-13, pp. 200\u2013214. IEEE (2000)","DOI":"10.1109\/CSFW.2000.856937"},{"issue":"4","key":"16_CR24","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1145\/265924.265927","volume":"15","author":"S Savage","year":"1997","unstructured":"Savage, S., Burrows, M., Nelson, G., Sobalvarro, P., Anderson, T.: Eraser: a dynamic data race detector for multithreaded programs. ACM Trans. Comput. Syst. (TOCS) 15(4), 391\u2013411 (1997)","journal-title":"ACM Trans. Comput. Syst. (TOCS)"},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Sui, Y., Di, P., Xue, J.: Sparse flow-sensitive pointer analysis for multithreaded programs. In: 2016 IEEE\/ACM International Symposium on Code Generation and Optimization (CGO), pp. 160\u2013170. IEEE (2016)","DOI":"10.1145\/2854038.2854043"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-642-18378-2_15","volume-title":"International Symposium on Practical Aspects of Declarative Languages","author":"D Syme","year":"2011","unstructured":"Syme, D., Petricek, T., Lomov, D.: The f# asynchronous programming model. In: Rocha, R., Launchbury, J. (eds.) PADL 2011. LNCS, vol. 6539, pp. 175\u2013189. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-18378-2_15"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2017"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62407-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T21:08:25Z","timestamp":1750626505000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-62407-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319624068","9783319624075"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62407-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"15 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trieste","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}