{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:51:42Z","timestamp":1725889902222},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642331244"},{"type":"electronic","value":"9783642331251"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33125-1_4","type":"book-chapter","created":{"date-parts":[[2012,8,29]],"date-time":"2012-08-29T02:47:24Z","timestamp":1346208444000},"page":"5-23","source":"Crossref","is-referenced-by-count":6,"title":["Efficient May Happen in Parallel Analysis for Async-Finish Parallelism"],"prefix":"10.1007","author":[{"given":"Jonathan K.","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Palsberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rupak","family":"Majumdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_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.) PPOPP, pp. 183\u2013193. ACM (2007)","DOI":"10.1145\/1229428.1229471"},{"key":"4_CR2","volume-title":"Compilers: Principles, Techniques, and Tools","author":"A.V. Aho","year":"1986","unstructured":"Aho, A.V., Sethi, R.I., Ullman, J.D.: Compilers: Principles, Techniques, and Tools, 2nd edn. Addison-Wesley, Reading (1986)","edition":"2"},{"key":"4_CR3","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":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/11539452_36","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"A. Bouajjani","year":"2005","unstructured":"Bouajjani, A., M\u00fcller-Olm, M., Touili, T.: Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 473\u2013487. Springer, Heidelberg (2005)"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Charles, P., Donawa, C., Ebcioglu, K., Grothoff, C., Kielstra, A., Sarkar, V., Von Praun, C.: X10: An object-oriented approach to non-uniform cluster computing. In: Proceedings of the 20th ACM SIGPLAN Conference on Object-oriented Programing, Systems, Languages, and Applications, pp. 519\u2013538. ACM SIGPLAN (2005)","DOI":"10.1145\/1094811.1094852"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Choi, J.-D., Lee, K., Loginov, A., O\u2019Callahan, R., Sarkar, V., Sridharan, M.: Efficient and precise datarace detection for multithreaded object-oriented programs. In: PLDI, pp. 258\u2013269 (2002)","DOI":"10.1145\/543552.512560"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Duesterwald, E., Soffa, M.L.: Concurrency analysis in the presence of procedures using a data-flow framework. In: Symposium on Testing, Analysis, and Verification, pp. 36\u201348 (1991)","DOI":"10.1145\/120807.120811"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-642-18275-4_15","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"T.M. Gawlitza","year":"2011","unstructured":"Gawlitza, T.M., Lammich, P., M\u00fcller-Olm, M., Seidl, H., Wenner, A.: Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol.\u00a06538, pp. 199\u2013213. Springer, Heidelberg (2011)"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Kahlon, V.: Boundedness vs. unboundedness of lock chains: Characterizing decidability of pairwise CFL-reachability for threads communicating via locks. In: LICS 2009, 24th Annual Symposium on Logic in Computer Science, pp. 27\u201336 (2009)","DOI":"10.1109\/LICS.2009.45"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-74407-8_20","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"P. Lammich","year":"2007","unstructured":"Lammich, P., M\u00fcller-Olm, M.: Precise Fixpoint-Based Analysis of Programs with Thread-Creation and Procedures. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol.\u00a04703, pp. 287\u2013302. Springer, Heidelberg (2007)"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Lee, J.K., Palsberg, J.: Featherweight X10: a core calculus for async-finish parallelism. In: Proceedings of PPOPP 2010, 15th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, Bangalore, India (January 2010)","DOI":"10.1145\/1693453.1693459"},{"key":"4_CR12","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":"4_CR13","doi-asserted-by":"crossref","unstructured":"Masticola, S.P., Ryder, B.G.: Non-concurrency analysis. In: PPOPP, pp. 129\u2013138 (1993)","DOI":"10.1145\/173284.155346"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Naik, M., Aiken, A.: Conditional must not aliasing for static race detection. In: Proceedings of POPL 2007, SIGPLAN\u2013SIGACT Symposium on Principles of Programming Languages, pp. 327\u2013338 (2007)","DOI":"10.1145\/1190215.1190265"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Naumovich, G., Avrunin, G.S.: A conservative data flow algorithm for detecting all pairs of statement that happen in parallel. In: SIGSOFT FSE, pp. 24\u201334 (1998)","DOI":"10.1145\/291252.288213"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/3-540-48166-4_21","volume-title":"Software Engineering - ESEC\/FSE \u201999","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. In: Wang, J., Lemoine, M. (eds.) ESEC 1999 and ESEC-FSE 1999. LNCS, vol.\u00a01687, pp. 338\u2013354. Springer, Heidelberg (1999)"},{"key":"4_CR17","unstructured":"Palsberg, J., Schwartzbach, M.I.: Object-Oriented Type Systems. John Wiley & Sons (1994)"},{"issue":"2","key":"4_CR18","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1145\/349214.349241","volume":"22","author":"G. Ramalingam","year":"2000","unstructured":"Ramalingam, G.: Context-sensitive synchronization-sensitive analysis is undecidable. ACM Transactions on Programming Languages and Systems\u00a022(2), 416\u2013430 (2000)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-46425-5_23","volume-title":"Programming Languages and Systems","author":"H. Seidl","year":"2000","unstructured":"Seidl, H., Steffen, B.: Constraint-Based Inter-Procedural Analysis of Parallel Programs. In: Smolka, G. (ed.) ESOP 2000. LNCS, vol.\u00a01782, pp. 351\u2013365. Springer, Heidelberg (2000)"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Sen, K.: Race directed random testing of concurrent programs. In: Proceedings of PLDI 2008, ACM SIGPLAN Conference on Programming Language Design and Implementation, Tucson, Arizona, pp. 11\u201321 (June 2008)","DOI":"10.1145\/1375581.1375584"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF00263928","volume":"19","author":"R.N. Taylor","year":"1983","unstructured":"Taylor, R.N.: Complexity of analyzing the synchronization structure of concurrent programs. Acta Inf.\u00a019, 57\u201384 (1983)","journal-title":"Acta Inf."}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33125-1_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:56:17Z","timestamp":1620114977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33125-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642331244","9783642331251"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33125-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}