{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T03:17:07Z","timestamp":1673579827752},"reference-count":6,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2003,6]]},"abstract":"<jats:p> Induction variable analysis is an important part of the symbolic analysis in parallelizing compilers. Induction variables can be formed by for or [Formula: see text] loops within procedures or loops of recursive procedure calls. This paper presents an algorithm to find induction variables in formal parameters of procedures caused by recursive procedure calls. The compile-time knowledge of induction variables in formal parameters is essential to summarize array sections to be used for data dependence test and parallelization. <\/jats:p>","DOI":"10.1142\/s0129054103001819","type":"journal-article","created":{"date-parts":[[2003,7,24]],"date-time":"2003-07-24T07:23:50Z","timestamp":1059031430000},"page":"405-423","source":"Crossref","is-referenced-by-count":1,"title":["Interprocedural Induction Variable Analysis"],"prefix":"10.1142","volume":"14","author":[{"given":"Peiyi","family":"Tang","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Arkansas at Little Rock, 2801 South University Avenue, Little Rock, Arkansas 72204, United States of America"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pen-Chung","family":"Yew","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University of Minnesota, 4-192 EE\/CSci Building, 200 Union Street SE, Minneapolis, Minnesota 55455, United States of America"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf6","volume-title":"High Performance Compilers for Parallel Computing","author":"Wolfe M.","year":"1995"},{"key":"rf7","unstructured":"F. E.\u00a0Allen, J.\u00a0Cocke and K.\u00a0Kennedy, Program Flow Analysis: Theory and Applications, eds. S. S.\u00a0Muchnick and N. D.\u00a0Jones (Prentice-Hall, 1981)\u00a0pp. 79\u2013101."},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1145\/359863.359888"},{"key":"rf11","volume-title":"Symbolic Analysis for Parallelizing Compilers","author":"Haghighat M. R.","year":"1995"},{"key":"rf13","volume-title":"Compilers: Principles, Techniques and Tools","author":"Aho A. V.","year":"1986"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1145\/115372.115320"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054103001819","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:38:22Z","timestamp":1565123902000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054103001819"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":6,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2003,6]]}},"alternative-id":["10.1142\/S0129054103001819"],"URL":"https:\/\/doi.org\/10.1142\/s0129054103001819","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}