{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,12]],"date-time":"2026-09-12T12:30:57Z","timestamp":1789216257428,"version":"build-2803163510"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642307928","type":"print"},{"value":"9783642307935","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30793-5_3","type":"book-chapter","created":{"date-parts":[[2012,6,8]],"date-time":"2012-06-08T11:34:33Z","timestamp":1339155273000},"page":"35-51","source":"Crossref","is-referenced-by-count":26,"title":["Analysis of May-Happen-in-Parallel in Concurrent Objects"],"prefix":"10.1007","author":[{"given":"Elvira","family":"Albert","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Antonio E.","family":"Flores-Montoya","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Samir","family":"Genaim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","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: PPOPP 2007, pp. 183\u2013193. ACM (2007)","DOI":"10.1145\/1229428.1229471"},{"key":"3_CR2","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1086.001.0001","volume-title":"Actors: A Model of Concurrent Computation in Distributed Systems","author":"G.A. Agha","year":"1986","unstructured":"Agha, G.A.: Actors: A Model of Concurrent Computation in Distributed Systems. MIT Press, Cambridge (1986)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-25318-8_19","volume-title":"Programming Languages and Systems","author":"E. Albert","year":"2011","unstructured":"Albert, E., Arenas, P., Genaim, S., G\u00f3mez-Zamalloa, M., Puebla, G.: Cost Analysis of Concurrent OO Programs. In: Yang, H. (ed.) APLAS 2011. LNCS, vol.\u00a07078, pp. 238\u2013254. Springer, Heidelberg (2011)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Albert, E., Arenas, P., Genaim, S., G\u00f3mez-Zamalloa, M., Puebla, G.: COSTABS: A Cost and Termination Analyzer for ABS. In: PEPM 2012, pp. 151\u2013154. ACM Press (January 2012)","DOI":"10.1145\/2103746.2103774"},{"key":"3_CR5","unstructured":"Armstrong, J., Virding, R., Wistrom, C., Williams, M.: Concurrent Programming in Erlang. Prentice Hall (1996)"},{"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.\u00a04339, pp. 152\u2013169. Springer, Heidelberg (2006)"},{"key":"3_CR7","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":"F.S. 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.\u00a04421, pp. 316\u2013330. Springer, Heidelberg (2007)"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/978-3-642-25271-6_8","volume-title":"FMCO 2010","author":"E.B. 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.\u00a06957, pp. 142\u2013164. Springer, Heidelberg (2011)"},{"key":"3_CR9","unstructured":"Lee, J.K., Palsberg, J., Majumdar, R.: Complexity results for may-happen-in-parallel analysis (2010) (manuscript)"},{"key":"3_CR10","first-page":"25","volume-title":"PPoPP 2010","author":"J.K. Lee","year":"2010","unstructured":"Lee, J.K., Palsberg, J.: Featherweight X10: A Core Calculus for Async-Finish Parallelism. In: PPoPP 2010, pp. 25\u201336. ACM, New York (2010)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/11532378_15","volume-title":"Languages and Compilers for High Performance Computing","author":"L. Li","year":"2005","unstructured":"Li, L., Verbrugge, C.: A Practical MHP Information Analysis for Concurrent Java Programs. In: Eigenmann, R., Li, Z., Midkiff, S.P. (eds.) LCPC 2004. LNCS, vol.\u00a03602, pp. 194\u2013208. Springer, Heidelberg (2005)"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Milanova, A., Rountev, A., Ryder, B.G.: Parameterized Object Sensitivity for Points-to and Side-effect Analyses for Java. In: ISSTA, pp. 1\u201311 (2002)","DOI":"10.1145\/566171.566174"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Naumovich, G., Avrunin, G.S.: A conservative data flow algorithm for detecting all pairs of statements that happen in parallel. In: SIGSOFT FSE 1998, vol.\u00a023(6), pp. 24\u201334 (1998)","DOI":"10.1145\/291252.288213"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Naumovich, G., Avrunin, G.S., Clarke, L.A.: An efficient algorithm for computing MHP information for concurrent java programs. In: ESEC \/ SIGSOFT FSE 1999, vol. 24(6), pp. 338\u2013354 (1999)","DOI":"10.1145\/318774.319252"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Whaley, J., Lam, M.S.: Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In: PLDI 2004, pp. 131\u2013144. ACM (2004)","DOI":"10.1145\/996841.996859"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30793-5_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:30:51Z","timestamp":1620127851000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30793-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642307928","9783642307935"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30793-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}