{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:35:23Z","timestamp":1768282523422,"version":"3.49.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319681665","type":"print"},{"value":"9783319681672","type":"electronic"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68167-2_3","type":"book-chapter","created":{"date-parts":[[2017,9,25]],"date-time":"2017-09-25T23:50:53Z","timestamp":1506383453000},"page":"42-58","source":"Crossref","is-referenced-by-count":3,"title":["May-Happen-in-Parallel Analysis with Returned Futures"],"prefix":"10.1007","author":[{"given":"Elvira","family":"Albert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samir","family":"Genaim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pablo","family":"Gordillo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,27]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, S., Barik, R., Sarkar, V., Shyamasundar, R.K.: May-happen-in-parallel analysis of x10 programs. In: Yelick, K.A., Mellor-Crummey, J.M. (eds.) Proceedings of PPOPP 2007, pp. 183\u2013193. ACM (2007)","DOI":"10.1145\/1229428.1229471"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/978-3-642-54862-8_46","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E Albert","year":"2014","unstructured":"Albert, E., Arenas, P., Flores-Montoya, A., Genaim, S., G\u00f3mez-Zamalloa, M., Martin-Martin, E., Puebla, G., Rom\u00e1n-D\u00edez, G.: SACO: static analyzer for concurrent objects. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 562\u2013567. Springer, Heidelberg (2014). doi: 10.1007\/978-3-642-54862-8_46"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-30793-5_3","volume-title":"Formal Techniques for Distributed Systems","author":"E Albert","year":"2012","unstructured":"Albert, E., Flores-Montoya, A.E., Genaim, S.: Analysis of may-happen-in-parallel in concurrent objects. In: Giese, H., Rosu, G. (eds.) FMOODS\/FORTE -2012. LNCS, vol. 7273, pp. 35\u201351. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-30793-5_3"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-319-02444-8_25","volume-title":"Automated Technology for Verification and Analysis","author":"E Albert","year":"2013","unstructured":"Albert, E., Flores-Montoya, A., Genaim, S., Martin-Martin, E.: Termination and cost analysis of loops with concurrent interleavings. In: Van Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol. 8172, pp. 349\u2013364. Springer, Cham (2013). doi: 10.1007\/978-3-319-02444-8_25"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-662-48288-9_5","volume-title":"Static Analysis","author":"E Albert","year":"2015","unstructured":"Albert, E., Genaim, S., Gordillo, P.: May-happen-in-parallel analysis for asynchronous programs with inter-procedural synchronization. In: Blazy, S., Jensen, T. (eds.) SAS 2015. LNCS, vol. 9291, pp. 72\u201389. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-48288-9_5"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-540-69330-7_11","volume-title":"Languages and Compilers for Parallel Computing","author":"R Barik","year":"2006","unstructured":"Barik, R.: Efficient computation of may-happen-in-parallel information for concurrent Java programs. In: Ayguad\u00e9, E., Baumgartner, G., Ramanujam, J., Sadayappan, P. (eds.) LCPC 2005. LNCS, vol. 4339, pp. 152\u2013169. Springer, Heidelberg (2006). doi: 10.1007\/978-3-540-69330-7_11"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Chang, C.W., D\u00f6mer, R.: May-happen-in-parallel analysis of ESL models using UPPAAL model checking. In: DATE 2015, pp. 1567\u20131570. IEEE, March 2015","DOI":"10.7873\/DATE.2015.0219"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Chen, C., Huo, W., Li, L., Feng, X., Xing, K.: Can we make it faster? Efficient may-happen-in-parallel analysis revisited. In PDCAT 2012, pp. 59\u201364, December 2012","DOI":"10.1109\/PDCAT.2012.59"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Chen, W., Han, X., D\u00f6mer, R.: May-happen-in-parallel analysis based on segment graphs for safe ESL models. In: DATE 2014, pp. 1\u20136. IEEE, March 2014","DOI":"10.7873\/DATE.2014.300"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-540-71316-6_22","volume-title":"Programming Languages and Systems","author":"FS Boer de","year":"2007","unstructured":"de Boer, F.S., Clarke, D., Johnsen, E.B.: A complete guide to the future. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 316\u2013330. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-71316-6_22"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Di, P., Sui, Y., Ye, D., Xue, J.: Region-based may-happen-in-parallel analysis for C programs. In: ICPP 2015, pp. 889\u2013898. IEEE, September 2015","DOI":"10.1109\/ICPP.2015.98"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Flanagan, C., Felleisen, M.: The semantics of future and its use in program optimization. In: POPL 1995, 22nd ACM SIGPLAN-SIGACT (1995)","DOI":"10.1145\/199448.199484"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-642-38592-6_19","volume-title":"Formal Techniques for Distributed Systems","author":"AE Flores-Montoya","year":"2013","unstructured":"Flores-Montoya, A.E., Albert, E., Genaim, S.: May-happen-in-parallel based deadlock analysis for concurrent objects. In: Beyer, D., Boreale, M. (eds.) FMOODS\/FORTE -2013. LNCS, vol. 7892, pp. 273\u2013288. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-38592-6_19"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-25271-6_8","volume-title":"Formal Methods for Components and Objects","author":"EB Johnsen","year":"2011","unstructured":"Johnsen, E.B., H\u00e4hnle, R., Sch\u00e4fer, J., Schlatte, R., Steffen, M.: ABS: a core language for abstract behavioral specification. In: Aichernig, B.K., de Boer, F.S., Bonsangue, M.M. (eds.) FMCO 2010. LNCS, vol. 6957, pp. 142\u2013164. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-25271-6_8"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-3-642-33125-1_4","volume-title":"Static Analysis","author":"JK Lee","year":"2012","unstructured":"Lee, J.K., Palsberg, J., Majumdar, R., Hong, H.: Efficient may happen in parallel analysis for async-finish parallelism. In: Min\u00e9, A., Schmidt, D. (eds.) SAS 2012. LNCS, vol. 7460, pp. 5\u201323. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-33125-1_4"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Sankar, A., Chakraborty, S., Nandivada, V.K.: Improved MHP analysis. In: CC 2016, pp. 207\u2013217. ACM, September 2016","DOI":"10.1145\/2892208.2897144"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68167-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T19:37:28Z","timestamp":1570131448000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68167-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319681665","9783319681672"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68167-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}