{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:45:14Z","timestamp":1743101114043,"version":"3.40.3"},"publisher-location":"Cham","reference-count":5,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030805142"},{"type":"electronic","value":"9783030805159"}],"license":[{"start":{"date-parts":[[2021,6,12]],"date-time":"2021-06-12T00:00:00Z","timestamp":1623456000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,6,12]],"date-time":"2021-06-12T00:00:00Z","timestamp":1623456000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-80515-9_10","type":"book-chapter","created":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T20:04:54Z","timestamp":1670529894000},"page":"123-133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Loop Tree and Induction Variables"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Pop","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Albert","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,12]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Bachmann, O., Wang, P. S., & Zima, E. V. (1994). Chains of recurrences\u2014A method to expedite the evaluation of closed-form functions. In Proceedings of the International Symposium on Symbolic and Algebraic Computation (pp. 242\u2013249).","key":"10_CR15","DOI":"10.1145\/190347.190423"},{"key":"10_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-6894-6","volume-title":"Dependence analysis for supercomputing","author":"U Banerjee","year":"1988","unstructured":"Banerjee, U. (1988). Dependence analysis for supercomputing. Alphen aan den Rijn: Kluwer Academic Publishers."},{"doi-asserted-by":"crossref","unstructured":"Kislenkov, V., Mitrofanov, V., & Zima, E. V. (1998). Multidimensional chains of recurrences. In Proceedings of the International Symposium on Symbolic and Algebraic Computation (pp. 199\u2013206).","key":"10_CR167","DOI":"10.1145\/281508.281613"},{"doi-asserted-by":"crossref","unstructured":"Pugh, W. (1991). Uniform techniques for loop optimization. In Proceedings of the International Conference on Supercomputing. ICS \u201991 (pp. 341\u2013352).","key":"10_CR235","DOI":"10.1145\/109025.109108"},{"doi-asserted-by":"crossref","unstructured":"Zima, E. V. (2001). On computational properties of chains of recurrences. In Proceedings of the International Symposium on Symbolic and Algebraic Computation (pp. 345\u2013352).","key":"10_CR318","DOI":"10.1145\/384101.384148"}],"container-title":["SSA-based Compiler Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-80515-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T20:05:20Z","timestamp":1670529920000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-80515-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,12]]},"ISBN":["9783030805142","9783030805159"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-80515-9_10","relation":{},"subject":[],"published":{"date-parts":[[2021,6,12]]},"assertion":[{"value":"12 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}