{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:08:42Z","timestamp":1742393322256},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428626"},{"type":"electronic","value":"9783540455745"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45574-4_19","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:48:41Z","timestamp":1184600921000},"page":"289-303","source":"Crossref","is-referenced-by-count":4,"title":["A Comparative Analysis of Dependence Testing Mechanisms"],"prefix":"10.1007","author":[{"given":"Jay","family":"Hoeflinger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunheung","family":"Paek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,12,4]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"V. Balasundaram and K. Kennedy. A Technique for Summarizing Data Access and its Use in Parallelism Enhancing Transformations. Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation, June 1989.","DOI":"10.1145\/73141.74822"},{"key":"19_CR2","series-title":"PhD thesis","volume-title":"Symbolic Analysis Techniques for Effective Automatic Parallelization","author":"W. Blume","year":"1995","unstructured":"W. Blume. Symbolic Analysis Techniques for Effective Automatic Parallelization. PhD thesis, Univ. of Illinois at Urbana-Champaign, Dept. of Computer Science, June 1995."},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"William Blume and Rudolf Eigenmann. Non-linear and symbolic data dependence testing. IEEE Transactions on Parallel and Distributed Systems, 9(12), December 1998.","DOI":"10.1109\/71.737695"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"S. Cook. The complexity of theorem-proving procedures. Proceedings of the Third Annual ACM Symposium on Theory of Computing, 1971. New York, NY.","DOI":"10.1145\/800157.805047"},{"key":"19_CR5","series-title":"Lect Notes Comput Sci","volume-title":"Interprocedural Array Region Analyses","author":"B. Creusillet","year":"1995","unstructured":"B. Creusillet and F. Irigoin. Interprocedural Array Region Analyses. In Lecture Notes in Computer Science. Springer Verlag, New York, New York, August 1995."},{"key":"19_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Exact vs. Approximate Array Region Analyses","author":"B. Creusillet","year":"1996","unstructured":"B. Creusillet and F. Irigoin. Exact vs. Approximate Array Region Analyses. In Lecture Notes in Computer Science. Springer Verlag, New York, New York, August 1996."},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"G. Dantzig. Linear Programming and Extensions. Princeton University Press, 1963.","DOI":"10.7249\/R366"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"G. Goff, K. Kennedy, and C. Tseng. Practical Dependence Testing. In Proceedings of the ACM SIGPLAN 91 Conference on Programming Language Design and Implementation, pages 15\u201329, June 1991.","DOI":"10.1145\/113445.113448"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"M. Hall, B. Murphy, S. Amarasinghe, S. Liao, and M. Lam. Detecting Coarsegrain Parallelism Using An Interprocedural Parallelizing Compiler. Proceedings of Supercomputing\u2019 95, December 1995.","DOI":"10.1145\/224170.224337"},{"issue":"3","key":"19_CR10","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1109\/71.86110","volume":"2","author":"P. Havlak","year":"1991","unstructured":"P. Havlak and K. Kennedy. An Implementation of Interprocedural Bounded Regular Section Analysis. IEEE Transactions on Parallel and Distributed Systems, 2(3):350\u2013360, July 1991.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"19_CR11","series-title":"PhD thesis","volume-title":"Interprocedural Parallelization Using Memory Classification Analysis","author":"J. Hoeflinger","year":"1998","unstructured":"J. Hoeflinger. Interprocedural Parallelization Using Memory Classification Analysis. PhD thesis, Univ. of Illinois at Urbana-Champaign, Dept. of Computer Science, August, 1998."},{"key":"19_CR12","unstructured":"J. Hoeflinger, Y. Paek, and K. Yi. Unified Interprocedural Parallelism Detection. accepted by the International Journal of Parallel Processing, 2000."},{"issue":"3","key":"19_CR13","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1109\/71.86109","volume":"2","author":"X. Kong","year":"1991","unstructured":"X. Kong, D. Klappholz, and K. Pssaris. The I Test: An Improved Dependence Test for Automatic Parallelization and Vectorization. IEEE Transactions on Parallel and Distributed Systems, 2(3):342\u2013349, 1991.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"1","key":"19_CR14","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/71.80122","volume":"1","author":"Z. Li","year":"1990","unstructured":"Z. Li, P. Yew, and C. Zhu. An Efficient Data Dependence Analysis for Parallelizing Compilers. IEEE Transactions on Parallel and Distributed Systems, 1(1):26\u201334, January 1990.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"V. Maslov. Delinearization: An Efficient Way to Break Multi loop Dependence Equations. Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation, June 1991.","DOI":"10.1145\/143095.143130"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"D. Maydan, J. Hennessy, and M. Lam. Efficient and Exact Data Dependence Analysis. Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation, June 1991.","DOI":"10.1145\/113445.113447"},{"key":"19_CR17","series-title":"PhD thesis","volume-title":"Automatic Parallelization for Distributed Memory Machines Based on Access Region Analysis","author":"Y. Paek","year":"1997","unstructured":"Y. Paek. Automatic Parallelization for Distributed Memory Machines Based on Access Region Analysis. PhD thesis, Univ. of Illinois at Urbana-Champaign, Dept. of Computer Science, April 1997."},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Y. Paek, J. Hoeflinger, and D. Padua. Simplification of Array Access Patterns for Compiler Optimizations. Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation, June 1998.","DOI":"10.1145\/277650.277664"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"W. Pugh. A Practical Algorithm for Exact Array Dependence Analysis. Communications of the ACM, 35(8), August 1992.","DOI":"10.1145\/135226.135233"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"P. Tang. Exact Side Effects for Interprocedural Dependence Analysis. In 1993 ACM International Conference on Supercomputing,Tokyo, Japan, pages 137\u2013146, July 1993.","DOI":"10.1145\/165939.165964"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"P. Tu and D. Padua. Gated SSA-Based Demand-Driven Symbolic Analysis for Parallelizing Compilers. ACM International Conference on Supercomputing, pages 414\u2013423, July 1995.","DOI":"10.1145\/224538.224648"},{"key":"19_CR22","volume-title":"High Performance Compilers for Parallel Computers","author":"M. Wolfe","year":"1996","unstructured":"M. Wolfe. High Performance Compilers for Parallel Computers. Addison-Wesley, California, 1996."},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"M. Wolfe and C. Tseng. The Power Test for Data Dependence. IEEE Transactions on Parallel and Distributed Systems, September 1992.","DOI":"10.1109\/71.159042"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45574-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T03:05:49Z","timestamp":1556679949000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45574-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428626","9783540455745"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-45574-4_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}