{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:24:07Z","timestamp":1725578647844},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642198601"},{"type":"electronic","value":"9783642198618"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-19861-8_12","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T17:39:26Z","timestamp":1300124366000},"page":"198-224","source":"Crossref","is-referenced-by-count":1,"title":["Using Disjoint Reachability for Parallelization"],"prefix":"10.1007","author":[{"given":"James","family":"Jenista","sequence":"first","affiliation":[]},{"given":"Yong hun","family":"Eom","sequence":"additional","affiliation":[]},{"given":"Brian","family":"Demsky","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Shapiro, M., Horwitz, S.: Fast and accurate flow-insensitive points-to analysis. In: POPL (1997)","key":"12_CR1","DOI":"10.1145\/263699.263703"},{"doi-asserted-by":"crossref","unstructured":"Landi, W., Ryder, B.G., Zhang, S.: Interprocedural modification side effect analysis with pointer aliasing. In: PLDI (1993)","key":"12_CR2","DOI":"10.1145\/155090.155096"},{"doi-asserted-by":"crossref","unstructured":"Chase, D.R., Wegman, M., Zadeck, F.K.: Analysis of pointers and structures. In: PLDI (1990)","key":"12_CR3","DOI":"10.1145\/93542.93585"},{"doi-asserted-by":"crossref","unstructured":"Ghiya, R., Hendren, L.J.: Is it a tree, a dag, or a cyclic graph? A shape analysis for heap-directed pointers in C. In: POPL (1996)","key":"12_CR4","DOI":"10.1145\/237721.237724"},{"doi-asserted-by":"crossref","unstructured":"Sagiv, M., Reps, T., Wilhelm, R.: Parametric shape analysis via 3-valued logic. TOPLAS (2002)","key":"12_CR5","DOI":"10.1145\/514188.514190"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/11513988_47","volume-title":"Computer Aided Verification","author":"S. McPeak","year":"2005","unstructured":"McPeak, S., Necula, G.C.: Data structure specifications via local equality axioms. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 476\u2013490. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Marron, M., Kapur, D., Hermenegildo, M.: Identification of logically related heap regions. In: ISMM (2009)","key":"12_CR7","DOI":"10.1145\/1542431.1542445"},{"doi-asserted-by":"crossref","unstructured":"Diwan, A., McKinley, K.S., Moss, J.E.B.: Type-based alias analysis. In: PLDI (1998)","key":"12_CR8","DOI":"10.1145\/277650.277670"},{"doi-asserted-by":"crossref","unstructured":"Ruf, E.: Partitioning dataflow analyses using types. In: POPL (1997)","key":"12_CR9","DOI":"10.1145\/263699.263705"},{"doi-asserted-by":"crossref","unstructured":"Deutsch, A.: Interprocedural may-alias analysis for pointers: Beyond k-limiting. In: PLDI (1994)","key":"12_CR10","DOI":"10.1145\/178243.178263"},{"doi-asserted-by":"crossref","unstructured":"Naik, M., Aiken, A.: Conditional must not aliasing for static race detection. In: POPL (2007)","key":"12_CR11","DOI":"10.1145\/1190216.1190265"},{"unstructured":"Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. LICS (2002)","key":"12_CR12"},{"doi-asserted-by":"crossref","unstructured":"Choi, J.D., Burke, M., Carini, P.: Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects. In: POPL (1993)","key":"12_CR13","DOI":"10.1145\/158511.158639"},{"doi-asserted-by":"crossref","unstructured":"Jenista, J.C., Eom, Y., Demsky, B.: OoOJava: An out-of-order approach to parallel programming. In: HotPar (2010)","key":"12_CR14","DOI":"10.1145\/1941553.1941563"},{"doi-asserted-by":"crossref","unstructured":"Jenista, J.C., Eom, Y., Demsky, B.: OoOJava: Software out-of-order execution. In: PPoPP (2011)","key":"12_CR15","DOI":"10.1145\/1941553.1941563"},{"doi-asserted-by":"crossref","unstructured":"Zhou, J., Demsky, B.: Bamboo: A data-centric, object-oriented approach to multi-core software. In: PLDI (June 2010)","key":"12_CR16","DOI":"10.1145\/1806596.1806640"},{"doi-asserted-by":"crossref","unstructured":"Rinetzky, N., Bauer, J., Reps, T., Sagiv, M., Wilhelm, R.: A semantics for procedure local heaps and its abstractions. In: POPL (2005)","key":"12_CR17","DOI":"10.1145\/1040305.1040330"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-540-78791-4_17","volume-title":"Compiler Construction","author":"M. Marron","year":"2008","unstructured":"Marron, M., Hermenegildo, M., Kapur, D., Stefanovic, D.: Efficient context-sensitive shape analysis with graph based heap models. In: Hendren, L. (ed.) CC 2008. LNCS, vol.\u00a04959, pp. 245\u2013259. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Smith, L.A., Bull, J.M., Obdrz\u00e1lek, J.: A parallel Java Grande benchmark suite. In: SC (2001)","key":"12_CR19","DOI":"10.1145\/582034.582042"},{"unstructured":"Cao Minh, C., Chung, J., Kozyrakis, C., Olukotun, K.: STAMP: Stanford transactional applications for multi-processing. In: IISWC (2008)","key":"12_CR20"},{"unstructured":"Cahoon, B., McKinley, K.S.: Data flow analysis for software prefetching linked data structures in Java. In: PACT (2001)","key":"12_CR21"},{"doi-asserted-by":"crossref","unstructured":"Venkata, S.K., Ahn, I., Jeon, D., Gupta, A., Louie, C., Garcia, S., Belongie, S., Taylor, M.B.: SD-VBS: The San Diego Vision Benchmark Suite. In: IISWC (2009)","key":"12_CR22","DOI":"10.1109\/IISWC.2009.5306794"},{"doi-asserted-by":"crossref","unstructured":"Calcagno, C., Distefano, D., OHearn, P., Yang, H.: Compositional shape analysis by means of bi-abduction. In: POPL (2009)","key":"12_CR23","DOI":"10.1145\/1594834.1480917"},{"doi-asserted-by":"crossref","unstructured":"Marron, M., M\u00e9ndez-Lojo, M., Hermenegildo, M., Stefanovic, D., Kapur, D.: Sharing analysis of arrays, collections, and recursive structures. In: PASTE (2008)","key":"12_CR24","DOI":"10.1145\/1512475.1512485"},{"doi-asserted-by":"crossref","unstructured":"Distefano, D., OHearn, P.W., Yang, H.: A local shape analysis based on separation logic. LNCS (2006)","key":"12_CR25","DOI":"10.1007\/11691372_19"},{"key":"12_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-642-00590-9_25","volume-title":"Programming Languages and Systems","author":"M. Raza","year":"2009","unstructured":"Raza, M., Calcagno, C., Gardner, P.: Automatic parallelization with separation logic. In: Castagna, G. (ed.) ESOP 2009. LNCS, vol.\u00a05502, pp. 348\u2013362. Springer, Heidelberg (2009)"},{"doi-asserted-by":"crossref","unstructured":"Lattner, C., Adve, V.: Automatic pool allocation: improving performance by controlling data structure layout in the heap. In: PLDI (2005)","key":"12_CR27","DOI":"10.1145\/1065010.1065027"},{"doi-asserted-by":"crossref","unstructured":"Chatterjee, R., Ryder, B.G., Landi, W.A.: Relevant context inference. In: POPL (1999)","key":"12_CR28","DOI":"10.1145\/292540.292554"},{"key":"12_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-540-78163-9_17","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"M. M\u00e9ndez-Lojo","year":"2008","unstructured":"M\u00e9ndez-Lojo, M., Hermenegildo, M.V.: Precise set sharing analysis for Java-style programs. In: Logozzo, F., Peled, D.A., Zuck, L.D. (eds.) VMCAI 2008. LNCS, vol.\u00a04905, pp. 172\u2013187. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Ghiya, R., Hendren, L.J.: Connection analysis: A practical interprocedural heap analysis for C. IJPP (1996)","key":"12_CR30","DOI":"10.1007\/BFb0014221"},{"doi-asserted-by":"crossref","unstructured":"Clarke, D.G., Drossopoulou, S.: Ownership, Encapsulation and the Disjointness of Type and Effect. In: OOPSLA (2002)","key":"12_CR31","DOI":"10.1145\/582419.582447"},{"doi-asserted-by":"crossref","unstructured":"Heine, D.L., Lam, M.S.: A practical flow-sensitive and context-sensitive C and C++ memory leak detector. In: PLDI (2003)","key":"12_CR32","DOI":"10.1145\/781147.781150"},{"key":"12_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-642-11970-5_9","volume-title":"Compiler Construction","author":"A. Craik","year":"2010","unstructured":"Craik, A., Kelly, W.: Using ownership to reason about inherent parallelism in object-oriented programs. In: Gupta, R. (ed.) CC 2010. LNCS, vol.\u00a06011, pp. 145\u2013164. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19861-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T11:06:22Z","timestamp":1558436782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19861-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642198601","9783642198618"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19861-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}