{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T07:07:54Z","timestamp":1763968074187,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642360350"},{"type":"electronic","value":"9783642360367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36036-7_5","type":"book-chapter","created":{"date-parts":[[2013,1,17]],"date-time":"2013-01-17T01:59:30Z","timestamp":1358387970000},"page":"61-75","source":"Crossref","is-referenced-by-count":9,"title":["A Hybrid Approach to Proving Memory Reference Monotonicity"],"prefix":"10.1007","author":[{"given":"Cosmin E.","family":"Oancea","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawrence","family":"Rauchwerger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Allen, R., Kennedy, K.: Optimizing Compilers for Modern Architectures. Morgan Kaufmann (2002)"},{"key":"5_CR2","unstructured":"Banerjee, U.: Speedup of Ordinary Programs. Ph.D. Thesis, Dept. of Comp. Sci. Univ. of Illinois at Urbana-Champaign Report No. 79-989 (1988)"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1177\/109434208900300302","volume":"3","author":"M. Berry","year":"1988","unstructured":"Berry, M., et al.: The PERFECT Club Benchmarks: Effective Performance Evaluation of Supercomputers. Int. J. of Supercomputer Applications\u00a03, 5\u201340 (1988)","journal-title":"Int. J. of Supercomputer Applications"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1109\/71.180621","volume":"3","author":"W. Blume","year":"1992","unstructured":"Blume, W., Eigenmann, R.: Performance Analysis of Parallelizing Compilers on the Perfect Benchmarks Programs. IEEE Trans. Par. Distr. Sys.\u00a03, 643\u2013656 (1992)","journal-title":"IEEE Trans. Par. Distr. Sys."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Blume, W., Eigenmann, R.: The Range Test: A Dependence Test for Symbolic, Non-Linear Expressions. In: Procs. Int. Conf. on Supercomp., pp. 528\u2013537 (1994)","DOI":"10.1145\/602770.602858"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BFb0014197","volume-title":"Languages and Compilers for Parallel Computing","author":"W. Blume","year":"1996","unstructured":"Blume, W., Eigenmann, R.: Demand-Driven, Symbolic Range Propagation. In: Huang, C.-H., Sadayappan, P., Banerjee, U., Gelernter, D., Nicolau, A., Padua, D.A. (eds.) LCPC 1995. LNCS, vol.\u00a01033, pp. 141\u2013160. Springer, Heidelberg (1996)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Dang, F., Yu, H., Rauchwerger, L.: The R-LRPD Test: Speculative Parallelization of Partially Parallel Loops. In: Procs. of Int. Parallel and Distributed Processing Symp., pp. 20\u201329 (2002)","DOI":"10.1109\/IPDPS.2002.1015493"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Engelen, R.A.V.: A unified framework for nonlinear dependence testing and symbolic analysis. In: Procs. Int. Conf. on Supercomputing, pp. 106\u2013115 (2004)","DOI":"10.1145\/1006209.1006226"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1023\/A:1008013906463","volume":"12","author":"T. Fahringer","year":"1997","unstructured":"Fahringer, T.: Efficient symbolic analysis for parallelizing compilers and performance estimators. J. of Supercomputing\u00a012, 227\u2013252 (1997)","journal-title":"J. of Supercomputing"},{"issue":"3","key":"5_CR10","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1051\/ro\/1988220302431","volume":"22","author":"P. Feautrier","year":"1988","unstructured":"Feautrier, P.: Parametric Integer Programming. Operations Research\u00a022(3), 243\u2013268 (1988)","journal-title":"Operations Research"},{"issue":"1","key":"5_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF01407931","volume":"20","author":"P. Feautrier","year":"1991","unstructured":"Feautrier, P.: Dataflow Analysis of Array and Scalar References. Int. J. of Parallel Programming\u00a020(1), 23\u201354 (1991)","journal-title":"Int. J. of Parallel Programming"},{"issue":"4","key":"5_CR12","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1145\/1075382.1075385","volume":"27","author":"M.W. Hall","year":"2005","unstructured":"Hall, M.W., et al.: Interprocedural parallelization analysis in suif. ACM Trans. on Programming Languages and Systems\u00a027(4), 662\u2013731 (2005)","journal-title":"ACM Trans. on Programming Languages and Systems"},{"issue":"2","key":"5_CR13","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1023\/A:1007685003043","volume":"29","author":"J. Hoeflinger","year":"2001","unstructured":"Hoeflinger, J., Paek, Y., Yi, K.: Unified Interprocedural Parallelism Detection. Int. J. of Parallel Programming\u00a029(2), 185\u2013215 (2001)","journal-title":"Int. J. of Parallel Programming"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/3-540-44905-1_19","volume-title":"Languages and Compilers for Parallel Computing","author":"Y. Lin","year":"2000","unstructured":"Lin, Y., Padua, D.: Demand-Driven Interprocedural Array Property Analysis. In: Carter, L., Ferrante, J. (eds.) LCPC 1999. LNCS, vol.\u00a01863, pp. 303\u2013317. Springer, Heidelberg (2000)"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/3-540-46423-9_14","volume-title":"Compiler Construction","author":"Y. Lin","year":"2000","unstructured":"Lin, Y., Padua, D.: Analysis of Irregular Single-Indexed Array Accesses and Its Applications in Compiler Optimizations. In: Watt, D.A. (ed.) CC 2000. LNCS, vol.\u00a01781, pp. 202\u2013218. Springer, Heidelberg (2000)"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Moon, S., Hall, M.W.: Evaluation of predicated array data-flow analysis for automatic parallelization. In: Procs. Int. Princ. Pract. of Par. Prog., pp. 84\u201395 (1999)","DOI":"10.1145\/329366.301112"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-540-89740-8_11","volume-title":"Languages and Compilers for Parallel Computing","author":"C.E. Oancea","year":"2008","unstructured":"Oancea, C.E., Mycroft, A.: Set-Congruence Dynamic Analysis for Thread-Level Speculation (TLS). In: Amaral, J.N. (ed.) LCPC 2008. LNCS, vol.\u00a05335, pp. 156\u2013171. Springer, Heidelberg (2008)"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Oancea, C.E., Mycroft, A., Harris, T.: A Lightweight, In-Place Model for Software Thread-Level Speculation. In: Procs. Symp. Paral. Alg. Arch., pp. 223\u2013232 (2009)","DOI":"10.1145\/1583991.1584050"},{"issue":"1","key":"5_CR19","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1145\/509705.509708","volume":"24","author":"Y. Paek","year":"2002","unstructured":"Paek, Y., Hoeflinger, J., Padua, D.: Efficient and Precise Array Access Analysis. ACM Trans. on Programming Languages and Systems\u00a024(1), 65\u2013109 (2002)","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"5_CR20","first-page":"4","volume":"8","author":"W. Pugh","year":"1992","unstructured":"Pugh, W.: The Omega Test: a Fast and Practical Integer Programming Algorithm for Dependence Analysis. Communications of the ACM\u00a08, 4\u201313 (1992)","journal-title":"Communications of the ACM"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Pugh, W., Wonnacott, D.: Nonlinear Array Dependence Analysis. In: Proc. of Workshop on Lang. Comp. and Run-Time Support for Scallable Systems (1995)","DOI":"10.1007\/978-1-4615-2315-4_1"},{"issue":"2","key":"5_CR22","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1109\/71.752782","volume":"10","author":"L. Rauchwerger","year":"1999","unstructured":"Rauchwerger, L., Padua, D.: The LRPD Test: Speculative Run-Time Parallelization of Loops with Privatization and Reduction Parallelization. IEEE Trans. Par. Distr. Sys.\u00a010(2), 160\u2013199 (1999)","journal-title":"IEEE Trans. Par. Distr. Sys."},{"key":"5_CR23","first-page":"26","volume":"26","author":"L. Rauchwerger","year":"1995","unstructured":"Rauchwerger, L., Amato, N.M., Padua, D.A.: A scalable method for run-time loop parallelization. Int. J. of Parallel Programming\u00a026, 26\u20136 (1995)","journal-title":"Int. J. of Parallel Programming"},{"issue":"3","key":"5_CR24","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1023\/A:1024597010150","volume":"31","author":"S. Rus","year":"2003","unstructured":"Rus, S., Hoeflinger, J., Rauchwerger, L.: Hybrid analysis: Static & dynamic memory reference analysis. Int. J. of Parallel Programming\u00a031(3), 251\u2013283 (2003)","journal-title":"Int. J. of Parallel Programming"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Rus, S., Pennings, M., Rauchwerger, L.: Sensitivity Analysis for Automatic Parallelization on Multi-Cores. In: Procs. Int. Conf. on Supercomp., pp. 263\u2013273 (2007)","DOI":"10.1145\/1274971.1275008"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Rus, S., Zhang, D., Rauchwerger, L.: The Value Evolution Graph and its Use in Memory Reference Analysis. In: Procs. of Int. Conf. on Parallel Architectures and Compilation Techniques, pp. 243\u2013254 (2004)","DOI":"10.1109\/PACT.2004.1342558"},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/3-540-46423-9_16","volume-title":"Compiler Construction","author":"H. Yu","year":"2000","unstructured":"Yu, H., Rauchwerger, L.: Techniques for Reducing the Overhead of Run-Time Parallelization. In: Watt, D.A. (ed.) CC 2000. LNCS, vol.\u00a01781, pp. 232\u2013248. Springer, Heidelberg (2000)"}],"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\/978-3-642-36036-7_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T17:23:24Z","timestamp":1745947404000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36036-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642360350","9783642360367"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36036-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}