{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T05:21:17Z","timestamp":1738387277884,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540852605"},{"type":"electronic","value":"9783540852612"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85261-2_8","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T07:20:24Z","timestamp":1218525624000},"page":"110-124","source":"Crossref","is-referenced-by-count":0,"title":["Iteration Disambiguation for Parallelism Identification in Time-Sliced Applications"],"prefix":"10.1007","author":[{"given":"Shane","family":"Ryoo","sequence":"first","affiliation":[]},{"given":"Christopher I.","family":"Rodrigues","sequence":"additional","affiliation":[]},{"given":"Wen-mei W.","family":"Hwu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Ballance, R., Maccabe, A., Ottenstein, K.: The Program Dependence Web: A representation supporting control-, data-, and demand-driven interpretation of imperative languages. In: Proceedings of the ACM SIGPLAN 1990 Conference on Programming Language Design and Implementation, pp. 257\u2013271 (1990)","DOI":"10.1145\/93548.93578"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Choi, J.D., Burke, M.G., Carini, P.: Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects. In: Proceedings of the 20th ACM Symposium on Principles of Programming Languages, pp. 232\u2013245 (January 1993)","DOI":"10.1145\/158511.158639"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Deutsch, A.: A storeless model of aliasing and its abstractions using finite representations of right-regular equivalence relations. In: Proceedings of the 1992 International Conference on Computer Languages, pp. 2\u201313 (April 1992)","DOI":"10.1109\/ICCL.1992.185463"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Ghiya, R., Hendren, L.J.: Connection analysis: A practical interprocedural heap analysis for C. In: Proceedings of the Eighth Workshop on Languages and Compilers for Parallel Computing, pp. 515\u2013533 (August 1995)","DOI":"10.1007\/BFb0014221"},{"key":"8_CR5","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: Proceedings of the 23rd ACM Symposium on Principles of Programming Languages, pp. 1\u201315 (1996)","DOI":"10.1145\/237721.237724"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Guo, B., Vachharajani, N., August, D.I.: Shape analysis with inductive recursion synthesis. In: Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation (June 2007)","DOI":"10.1145\/1250734.1250764"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Hasti, R., Horwitz, S.: Using static single assignment form to improve owinsensitive pointer analysis. In: Proceedings of the ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation, pp. 97\u2013105 (June 1998)","DOI":"10.1145\/277650.277668"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Hind, M.: Pointer analysis: Haven\u2019t we solved this problem yet? In: Proceedings of the 2001 ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, pp. 54\u201361 (2001)","DOI":"10.1145\/379605.379665"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Jones, N.D., Muchnick, S.S.: Flow analysis and optimization of LISP-like structures. In: Proceedings of the 6th ACM SIGPLAN Symposium on Principles of Programming Languages, pp. 244\u2013256 (1981)","DOI":"10.1145\/567752.567776"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Landi, W., Ryder, B.G.: A safe approximate algorithm for interprocedural pointer aliasing. In: Proceedings of the ACM SIGPLAN 1992 Conference on Programming Language Design and Implementation, pp. 235\u2013248 (June 1992)","DOI":"10.1145\/143095.143137"},{"key":"8_CR11","unstructured":"MPEG Industry Forum, http:\/\/www.mpegif.org\/"},{"key":"8_CR12","unstructured":"Nystrom, E.M.: FULCRA Pointer Analysis Framework. PhD thesis, University of Illinois at Urbana-Champaign (2005)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Nystrom, E.M., Kim, H.-S., Hwu, W.W.: Importance of heap specialization in pointer analysis. In: Proceedings of ACM-SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, pp. 43\u201348 (June 2004)","DOI":"10.1145\/996821.996836"},{"issue":"1","key":"8_CR14","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-540-71528-3_13","volume":"1","author":"S. Ryoo","year":"2007","unstructured":"Ryoo, S., Ueng, S.-Z., Rodrigues, C.I., Kidd, R.E., Frank, M.I., Hwu, W.W.: Automatic discovery of coarse-grained parallelism in media applications. Transactions on High-Performance Embedded Architectures and Compilers\u00a01(1), 194\u2013213 (2007)","journal-title":"Transactions on High-Performance Embedded Architectures and Compilers"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Sagiv, M., Reps, T., Wilhelm, R.: Solving shape-analysis problems in languages with destructive updating. In: Proceedings of the ACM Symposium on Programming Languages, pp. 16\u201331 (January 1996)","DOI":"10.1145\/237721.237725"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Venet, A.: A scalable nonuniform pointer analysis for embedded programs. In: Proceedings of the International Static Analysis Symposium, pp. 149\u2013164 (2004)","DOI":"10.1007\/978-3-540-27864-1_13"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Wu, P., Feautrier, P., Padua, D., Sura, Z.: Instance-wise points-to analysis for loop-based dependence testing. In: Proceedings of the 16th International Conference on Supercomputing, pp. 262\u2013273 (2002)","DOI":"10.1145\/514191.514228"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85261-2_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T11:48:08Z","timestamp":1738324088000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85261-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540852605","9783540852612"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85261-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}