{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T07:17:41Z","timestamp":1725866261180},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319465586"},{"type":"electronic","value":"9783319465593"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-46559-3_1","type":"book-chapter","created":{"date-parts":[[2016,9,24]],"date-time":"2016-09-24T04:10:50Z","timestamp":1474690250000},"page":"1-19","source":"Crossref","is-referenced-by-count":0,"title":["May-Happen-in-Parallel Analysis with Condition Synchronization"],"prefix":"10.1007","author":[{"given":"Elvira","family":"Albert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Flores-Montoya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samir","family":"Genaim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,25]]},"reference":[{"key":"1_CR1","unstructured":"Ericsson AB. Erlang Efficiency Guide, 5.8., 5th edn., October 2011. http:\/\/www.erlang.org\/doc\/efficiency_guide\/users_guide.html"},{"key":"1_CR2","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"},{"issue":"3","key":"1_CR3","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1002\/stvr.1569","volume":"25","author":"E Albert","year":"2015","unstructured":"Albert, E., Arenas, P., Correas, J., Genaim, S., G\u00f3mez-Zamalloa, M., Puebla, G., Rom\u00e1n-D\u00edez, G.: Object-sensitive cost analysis for concurrent objects. Softw. Test. Verif. Reliab. 25(3), 218\u2013271 (2015)","journal-title":"Softw. Test. Verif. Reliab."},{"key":"1_CR4","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":"1_CR5","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: Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol. 8172, pp. 349\u2013364. Springer, Heidelberg (2013). doi: 10.1007\/978-3-319-02444-8_25"},{"key":"1_CR6","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":"1_CR7","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":"1_CR8","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","year":"2007","unstructured":"Boer, F.S., Clarke, D., Johnsen, E.B.: A complete guide to the future. In: Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 316\u2013330. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-71316-6_22"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Emmi, M., Lal, A., Qadeer, S.: Asynchronous programs with prioritized task-buffers. In: Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering, FSE 2012, pp. 48:1\u201348:11. ACM, New York (2012)","DOI":"10.1145\/2393596.2393652"},{"key":"1_CR10","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":"1_CR11","doi-asserted-by":"crossref","unstructured":"Giachino, E., Grazia, C.A., Laneve, C., Lienhardt, M., Wong, P.: Deadlock Analysis of Concurrent Objects - Theory and Practice (2013)","DOI":"10.1007\/978-3-642-38613-8_27"},{"issue":"2\u20133","key":"1_CR12","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/j.tcs.2008.09.019","volume":"410","author":"P Haller","year":"2009","unstructured":"Haller, P., Odersky, M.: Scala actors: unifying thread-based and event-based programming. Theor. Comput. Sci. 410(2\u20133), 202\u2013220 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR13","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., 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":"1_CR14","doi-asserted-by":"crossref","unstructured":"Lee, J.K., Palsberg, J.: Featherweight X10: a core calculus for async-finish parallelism. In: Proceedings of PPoPP 2010, pp. 25\u201336. ACM (2010)","DOI":"10.1145\/1693453.1693459"},{"key":"1_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1044834.1044835","volume":"14","author":"A Milanova","year":"2005","unstructured":"Milanova, A., Rountev, A., Ryder, B.G.: Parameterized object sensitivity for points-to analysis for Java. ACM Trans. Softw. Eng. Methodol. 14, 1\u201341 (2005)","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Naik, M., Park, C.-S., Sen, K., Gay, D.: Effective static deadlock detection. In: Proceedings of the 31st International Conference on Software Engineering, ICSE 2009, pp. 386\u2013396. IEEE Computer Society, Washington, DC (2009)","DOI":"10.1109\/ICSE.2009.5070538"},{"issue":"6","key":"1_CR17","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1145\/318774.319252","volume":"24","author":"G Naumovich","year":"1999","unstructured":"Naumovich, G., Avrunin, G.S., Clarke, L.A.: An efficient algorithm for computing MHP information for concurrent Java programs. SIGSOFT Softw. Eng. Not. 24(6), 338\u2013354 (1999). 319252","journal-title":"SIGSOFT Softw. Eng. Not."},{"key":"1_CR18","volume-title":"Principles of Program Analysis","author":"F Nielson","year":"2005","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis, 2nd edn. Springer, Heidelberg (2005)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Foundational and Practical Aspects of Resource Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46559-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T23:51:47Z","timestamp":1568418707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-46559-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319465586","9783319465593"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46559-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}