{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:32:04Z","timestamp":1725489124806},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540040293"},{"type":"electronic","value":"9783540357674"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-35767-x_28","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T03:19:15Z","timestamp":1187234355000},"page":"427-441","source":"Crossref","is-referenced-by-count":4,"title":["Induction Variable Analysis without Idiom Recognition: Beyond Monotonicity"],"prefix":"10.1007","author":[{"given":"Peng","family":"Wu","sequence":"first","affiliation":[]},{"given":"Albert","family":"Cohen","sequence":"additional","affiliation":[]},{"given":"David","family":"Padua","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Z. Ammarguellat and W.L. Harrison. Automatic recognition of induction & recurrence relations by abstract interpretation. In ACM Symp. on Programming Language Design and Implementation (PLDI\u201990), pages 283\u2013295, Yorkton Heights, NY, June 1990.","DOI":"10.1145\/93542.93583"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"W. Blume and R. Eigenmann. The range test: A dependence test for symbolic, non-linear expressions. In Supercomputing\u201994, pages 528\u2013537, Washington D.C., November 1994. IEEE Computer Society Press.","DOI":"10.1145\/602770.602858"},{"issue":"12","key":"28_CR3","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1109\/2.546612","volume":"29","author":"W. Blume","year":"1996","unstructured":"W. Blume, R. Eigenmann, K. Faigin, J. Grout, J. Hoeflinger, D. Padua, P. Petersen, W. Pottenger, L. Rauchwerger, P. Tu, and S. Weatherford. Parallel programming with Polaris. IEEE Computer, 29(12): 78\u201382, December 1996.","journal-title":"IEEE Computer"},{"key":"28_CR4","unstructured":"A. Cohen, P. Wu, and D. Padua. Pointer analysis for monotonic container traversals. Technical Report CSRD 1586, University of Illinois at Urbana-Champaign, January 2001."},{"issue":"4","key":"28_CR5","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1145\/115372.115320","volume":"13","author":"R. Cytron","year":"1991","unstructured":"R. Cytron, J. Ferrante, B.K. Rosen, M.N. Wegman, and F.K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Trans. on Programming Languages and Systems, 13(4): 451\u2013490, October 1991.","journal-title":"ACM Trans. on Programming Languages and Systems"},{"issue":"1","key":"28_CR6","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/200994.201003","volume":"17","author":"M.P. Gerlek","year":"1995","unstructured":"M.P. Gerlek, E. Stoltz, and M. Wolfe. Beyond induction variables: Detecting and classifying sequences using a demand-driven ssa form. ACM Trans. on Programming Languages and Systems, 17(1):85\u2013122, January 1995.","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"R. Gupta and M. Spezialetti. Loop monotonic computations: An approach for the efficient run-time detection of races. In ACM Symp. on Testing Analysis and Verification, pages 98\u2013111, 1991.","DOI":"10.1145\/120807.120816"},{"issue":"4","key":"28_CR8","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1145\/233561.233568","volume":"18","author":"M. Haghighat","year":"1996","unstructured":"M. Haghighat and C. Polychronopoulos. Symbolic analysis for parallelizing compilers. ACM Trans. on Programming Languages and Systems, 18(4):477\u2013518, July 1996.","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Y. Lin and D. Padua. Compiler analysis of irregular memory accesses. In ACM Symp. on Programming Language Design and Implementation (PLDI\u201900), Vancouver, British Columbia, Canada, June 2000.","DOI":"10.1145\/349299.349322"},{"key":"28_CR10","unstructured":"B. Pottenger and R. Eigenmann. Parallelization in the presence of generalized induction and reduction variables. In ACM Int. Conf. on Supercomputing (ICS\u201995), June 1995."},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"P. Wu, A. Cohen, D. Padua, and J. Hoeflinger. Monotonic evolution: An alternative to induction variable substitution for dependence analysis. In ACM Int. Conf. on Supercomputing, Sorrento, Italy, June 2001.","DOI":"10.1145\/377792.377809"},{"key":"28_CR12","unstructured":"Peng Wu. Analyses of pointers, induction variables, and container objects for dependence testing. Technical Report UIUCDCS-R-2001-2209, University of Illinois at Urbana-Champaign, May 2001. Ph.D Thesis."}],"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-35767-X_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T17:32:30Z","timestamp":1550770350000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-35767-X_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540040293","9783540357674"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-35767-x_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}