{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:07:02Z","timestamp":1763467622398,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":62,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,6,26]],"date-time":"2004-06-26T00:00:00Z","timestamp":1088208000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,6,26]]},"DOI":"10.1145\/1006209.1006226","type":"proceedings-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T15:55:38Z","timestamp":1090338938000},"page":"106-115","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["A unified framework for nonlinear dependence testing and symbolic analysis"],"prefix":"10.1145","author":[{"given":"Robert A.","family":"van Engelen","sequence":"first","affiliation":[{"name":"Florida State University, Tallahassee, FL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Birch","sequence":"additional","affiliation":[{"name":"Florida State University, Tallahassee, FL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Shou","sequence":"additional","affiliation":[{"name":"Florida State University, Tallahassee, FL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Walsh","sequence":"additional","affiliation":[{"name":"Florida State University, Tallahassee, FL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyle A.","family":"Gallivan","sequence":"additional","affiliation":[{"name":"Florida State University, Tallahassee, FL"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2004,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Compilers: Principles, Techniques and Tools","author":"AHO A.","year":"1985","unstructured":"AHO , A. , SETHI , R. , AND ULLMAN , J. Compilers: Principles, Techniques and Tools . Addison-Wesley Publishing Company , Reading MA , 1985 .]] AHO, A., SETHI, R., AND ULLMAN, J. Compilers: Principles, Techniques and Tools. Addison-Wesley Publishing Company, Reading MA, 1985.]]"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-4647-0_1"},{"key":"e_1_3_2_1_3_1","first-page":"79","volume-title":"Program Flow Analysis (New-Jersey","author":"ALLEN F.","year":"1981","unstructured":"ALLEN , F. , COCKE , J. , AND KENNEDY , K. Reduction of operator strength . In Program Flow Analysis (New-Jersey , 1981 ), S. Muchnick and N. Jones, Eds ., Prentice-Hall , pp. 79 -- 101 .]] ALLEN, F., COCKE, J., AND KENNEDY, K. Reduction of operator strength. In Program Flow Analysis (New-Jersey, 1981), S. Muchnick and N. Jones, Eds., Prentice-Hall, pp. 79--101.]]"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/53990.54014"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/93542.93583"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/190347.190423"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/535430"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/520550.835086"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.737695"},{"key":"e_1_3_2_1_11_1","first-page":"528","volume-title":"Supercomputing","author":"BLUME W.","year":"1994","unstructured":"BLUME , W. , AND EIGENMANN , R. The range test: a dependence test for symbolic non-linear expressions . In Supercomputing ( 1994 ), pp. 528 -- 537 .]] BLUME, W., AND EIGENMANN, R. The range test: a dependence test for symbolic non-linear expressions. In Supercomputing (1994), pp. 528--537.]]"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/645673.665696"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/645605.663081"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/12276.13328"},{"key":"e_1_3_2_1_15_1","first-page":"26","volume-title":"Proc. of the ACM SIGPLAN 2000 LCTES","author":"CINTRA M.","year":"2000","unstructured":"CINTRA , M. , AND ARAUJO , G. Array reference allocation using SSA-form and live range growth . In Proc. of the ACM SIGPLAN 2000 LCTES ( Vancouver , June 2000 ), pp. 26 -- 33 .]] CINTRA, M., AND ARAUJO, G. Array reference allocation using SSA-form and live range growth. In Proc. of the ACM SIGPLAN 2000 LCTES (Vancouver, June 2000), pp. 26--33.]]"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/209936.209947"},{"key":"e_1_3_2_1_17_1","first-page":"14","article-title":"Fourier-motzkin elimination and its dual","volume":"14","author":"DANTZIG G. B.","year":"1973","unstructured":"DANTZIG , G. B. , AND EAVES , B. C . Fourier-motzkin elimination and its dual . Journal of Combinatorial Theory 14 , 14 ( 1973 ), 288--297.]] DANTZIG, G. B., AND EAVES, B. C. Fourier-motzkin elimination and its dual. Journal of Combinatorial Theory 14, 14 (1973), 288--297.]]","journal-title":"Journal of Combinatorial Theory"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/178243.178259"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/155090.155097"},{"key":"e_1_3_2_1_20_1","first-page":"57","volume-title":"Proc. of ICPP'91 (St","volume":"1","author":"EIGENMANN R.","year":"1991","unstructured":"EIGENMANN , R. , HOEFLINGER , J. , JAXON , G. , LI , Z. , AND PADUA , D. Restructuring Fortran programs for Cedar . In Proc. of ICPP'91 (St . Charles, Illinois , 1991 ), vol. 1 , pp. 57 -- 66 .]] EIGENMANN, R., HOEFLINGER, J., JAXON, G., LI, Z., AND PADUA, D. Restructuring Fortran programs for Cedar. In Proc. of ICPP'91 (St. Charles, Illinois, 1991), vol. 1, pp. 57--66.]]"},{"key":"e_1_3_2_1_21_1","first-page":"65","volume-title":"4th Annual Workshop on Languages and Compilers for Parallel Computing, LNCS 589","author":"EIGENMANN R.","year":"1991","unstructured":"EIGENMANN , R. , HOEFLINGER , J. , LI , Z. , AND PADUA , D. Experience in the automatic parallelization of four perfect-benchmark programs . In 4th Annual Workshop on Languages and Compilers for Parallel Computing, LNCS 589 ( Santa Clara, CA , 1991 ), Springer Verlag, pp. 65 -- 83 .]] EIGENMANN, R., HOEFLINGER, J., LI, Z., AND PADUA, D. Experience in the automatic parallelization of four perfect-benchmark programs. In 4th Annual Workshop on Languages and Compilers for Parallel Computing, LNCS 589 (Santa Clara, CA, 1991), Springer Verlag, pp. 65--83.]]"},{"key":"e_1_3_2_1_22_1","unstructured":"EUROPEAN TELECOMMUNICATION STANDARD (ETSI). Digital cellular telecommunications system: ANSI-C code for the GSM enhanced full rate (EFR) speech codec. Available from http:\/\/www.etsi.org.]]  EUROPEAN TELECOMMUNICATION STANDARD (ETSI). Digital cellular telecommunications system: ANSI-C code for the GSM enhanced full rate (EFR) speech codec. Available from http:\/\/www.etsi.org.]]"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008013906463"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/263580.263648"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.888633"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/647477.727783"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/200994.201003"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/113446.113448"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/645670.665234"},{"key":"e_1_3_2_1_30_1","volume-title":"Symbolic Analysis for Parallelizing Compilers","author":"HAGHIGHAT M. R.","year":"1995","unstructured":"HAGHIGHAT , M. R. Symbolic Analysis for Parallelizing Compilers . Kluwer Academic Publishers , 1995 .]] HAGHIGHAT, M. R. Symbolic Analysis for Parallelizing Compilers. Kluwer Academic Publishers, 1995.]]"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/233561.233568"},{"key":"e_1_3_2_1_33_1","volume-title":"Experience with interprocedural analysis of array side effects. Supercomputing","author":"HAVLAK P.","year":"1990","unstructured":"HAVLAK , P. , AND KENNEDY , K. Experience with interprocedural analysis of array side effects. Supercomputing ( 1990 ), 952--961.]] HAVLAK, P., AND KENNEDY, K. Experience with interprocedural analysis of array side effects. Supercomputing (1990), 952--961.]]"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/263764.263785"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.86109"},{"key":"e_1_3_2_1_36_1","volume-title":"The Structure of Computers and Computations","author":"KUCK D.","year":"1987","unstructured":"KUCK , D. The Structure of Computers and Computations , vol. 1 . John Wiley and Sons , New York , 1987 .]] KUCK, D. The Structure of Computers and Computations, vol. 1. John Wiley and Sons, New York, 1987.]]"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/377792.377804"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/113445.113447"},{"key":"e_1_3_2_1_39_1","volume-title":"Morgan Kaufmann","author":"MUCHNICK S.","year":"1997","unstructured":"MUCHNICK , S. Advanced Compiler Design and Implementation . Morgan Kaufmann , San Fransisco, CA , 1997 .]] MUCHNICK, S. Advanced Compiler Design and Implementation. Morgan Kaufmann, San Fransisco, CA, 1997.]]"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/534997"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(01)00132-6"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.250105"},{"key":"e_1_3_2_1_43_1","volume-title":"International Conference on Parallel and Distributed Computing Systems","author":"PSARRIS K.","year":"2001","unstructured":"PSARRIS , K. , AND KYRIAKOPOULOS , K. Measuring the accuracy and efficiency of the data dependence tests . In International Conference on Parallel and Distributed Computing Systems ( 2001 ).]] PSARRIS, K., AND KYRIAKOPOULOS, K. Measuring the accuracy and efficiency of the data dependence tests. In International Conference on Parallel and Distributed Computing Systems (2001).]]"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/782814.782843"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/125826.125848"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/178243.178254"},{"key":"e_1_3_2_1_47_1","volume-title":"In 3rd Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers","author":"PUGH W.","year":"1994","unstructured":"PUGH , W. , AND WONNACOTT , D. Nonlinear array dependence analysis . In In 3rd Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers ( 1994 ).]] PUGH, W., AND WONNACOTT, D. Nonlinear array dependence analysis. In In 3rd Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers (1994).]]"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/349299.349325"},{"key":"e_1_3_2_1_49_1","first-page":"145","volume-title":"International Conference on Parallel Processing","volume":"2","author":"SHEN Z.","year":"1989","unstructured":"SHEN , Z. , LI , Z. , AND YEW , P.-C. An empirical study on array subscripts and data dependencies . In International Conference on Parallel Processing ( 1989 ), vol. 2 , pp. 145 -- 152 .]] SHEN, Z., LI, Z., AND YEW, P.-C. An empirical study on array subscripts and data dependencies. In International Conference on Parallel Processing (1989), vol. 2, pp. 145--152.]]"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/224538.224650"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/224538.224648"},{"key":"e_1_3_2_1_52_1","volume-title":"TR-000102, Computer Science Dept.","author":"VAN ENGELEN R.","year":"2000","unstructured":"VAN ENGELEN , R. Symbolic evaluation of chains of recurrences for loop optimization. Tech. rep ., TR-000102, Computer Science Dept. , Florida State University , 2000 .]] VAN ENGELEN, R. Symbolic evaluation of chains of recurrences for loop optimization. Tech. rep., TR-000102, Computer Science Dept., Florida State University, 2000.]]"},{"key":"e_1_3_2_1_53_1","first-page":"321","volume-title":"proceedings of CPC 2003","author":"VAN ENGELEN R.","year":"2003","unstructured":"VAN ENGELEN , R. , GALLIVAN , K. , AND WALSH , B. Tight timing estimation with the Newton-Gregory formulae . In proceedings of CPC 2003 ( Amsterdam, Netherlands , January 2003 ), pp. 321 -- 330 .]] VAN ENGELEN, R., GALLIVAN, K., AND WALSH, B. Tight timing estimation with the Newton-Gregory formulae. In proceedings of CPC 2003 (Amsterdam, Netherlands, January 2003), pp. 321--330.]]"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.5555\/647477.727776"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.5555\/572764.881663"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/143095.143131"},{"key":"e_1_3_2_1_57_1","volume-title":"High Performance Compilers for Parallel Computers","author":"WOLFE M.","year":"1996","unstructured":"WOLFE , M. High Performance Compilers for Parallel Computers . Addison-Wesley , Redwood City, CA , 1996 .]] WOLFE, M. High Performance Compilers for Parallel Computers. Addison-Wesley, Redwood City, CA, 1996.]]"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.159042"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/377792.377809"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1998.678175"},{"key":"e_1_3_2_1_61_1","first-page":"152","volume-title":"Proc. of DISCO'92","author":"ZIMA E.","year":"1992","unstructured":"ZIMA , E. Recurrent relations and speed-up of computations using computer algebra systems . In Proc. of DISCO'92 ( 1992 ), LNCS 721, pp. 152 -- 161 .]] ZIMA, E. Recurrent relations and speed-up of computations using computer algebra systems. In Proc. of DISCO'92 (1992), LNCS 721, pp. 152--161.]]"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/220346.220352"},{"key":"e_1_3_2_1_63_1","first-page":"11","article-title":"Automatic construction of systems of recurrence relations","volume":"24","author":"ZIMA E. V","year":"1986","unstructured":"ZIMA , E. V . Automatic construction of systems of recurrence relations . USSR Computational Mathematics and Mathematical Physics 24 , 11 - 12 ( 1986 ), 193--197.]] ZIMA, E. V. Automatic construction of systems of recurrence relations. USSR Computational Mathematics and Mathematical Physics 24, 11-12 (1986), 193--197.]]","journal-title":"USSR Computational Mathematics and Mathematical Physics"},{"key":"e_1_3_2_1_64_1","volume-title":"Supercompilers for Parallel and Vector Computers","author":"ZIMA H.","year":"1990","unstructured":"ZIMA , H. , AND CHAPMAN , B. Supercompilers for Parallel and Vector Computers . ACM Press , New York , 1990 .]] ZIMA, H., AND CHAPMAN, B. Supercompilers for Parallel and Vector Computers. ACM Press, New York, 1990.]]"}],"event":{"name":"ICS04: International Conference on Supercomputing 2004","sponsor":["ACM Association for Computing Machinery","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Malo France","acronym":"ICS04"},"container-title":["Proceedings of the 18th annual international conference on Supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1006209.1006226","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1006209.1006226","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:26:06Z","timestamp":1750281966000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1006209.1006226"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6,26]]},"references-count":62,"alternative-id":["10.1145\/1006209.1006226","10.1145\/1006209"],"URL":"https:\/\/doi.org\/10.1145\/1006209.1006226","relation":{},"subject":[],"published":{"date-parts":[[2004,6,26]]},"assertion":[{"value":"2004-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}