{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,23]],"date-time":"2025-11-23T18:22:38Z","timestamp":1763922158502,"version":"3.45.0"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032076113","type":"print"},{"value":"9783032076120","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T00:00:00Z","timestamp":1763942400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T00:00:00Z","timestamp":1763942400000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-07612-0_23","type":"book-chapter","created":{"date-parts":[[2025,11,23]],"date-time":"2025-11-23T17:57:20Z","timestamp":1763920640000},"page":"300-310","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Speculative Recursion Unrolling"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8250-3212","authenticated-orcid":false,"given":"Tim","family":"Heldmann","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8720-0181","authenticated-orcid":false,"given":"Tim","family":"Ziegler","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6937-1158","authenticated-orcid":false,"given":"Peter","family":"Arzt","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2711-3032","authenticated-orcid":false,"given":"Christian","family":"Bischof","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,24]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","unstructured":"Novillo, D.: SamplePGO - the power of profile guided optimizations without the usability burden. In: 2014 LLVM Compiler Infrastructure in HPC, pp. 22\u201328 (2014). https:\/\/doi.org\/10.1109\/LLVM-HPC.2014.8","DOI":"10.1109\/LLVM-HPC.2014.8"},{"key":"23_CR2","unstructured":"Clang compiler user\u2019s manual (2025). https:\/\/clang.llvm.org\/docs\/UsersManual.html"},{"key":"23_CR3","unstructured":"Annotate LLVM Documentation (2025). https:\/\/clang.llvm.org\/docs\/AttributeReference.html#annotate"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Lattner, C., Adve, V.: LLVM: a compilation framework for lifelong program analysis and transformation. In: Proceedings of the International Symposium on Code Generation and Optimization: Feedback-Directed and Runtime Optimization, CGO \u201904, pp.\u00a075, USA (2004). IEEE Computer Society. ISBN 0769521029","DOI":"10.1109\/CGO.2004.1281665"},{"key":"23_CR5","unstructured":"Abelson, H., Sussman, G,J.: Structure and Interpretation of Computer Programs. MIT Press (2002). ISBN 9780262011532"},{"key":"23_CR6","doi-asserted-by":"publisher","unstructured":"Clinger, W.D.: Proper tail recursion and space efficiency. In: Proceedings of the ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation, PLDI \u201998, pp. 174\u2013185, New York, NY, USA (1998). Association for Computing Machinery. ISBN 0897919874. https:\/\/doi.org\/10.1145\/277650.277719","DOI":"10.1145\/277650.277719"},{"key":"23_CR7","doi-asserted-by":"publisher","unstructured":"Stitt, G., Villarreal, J.: Recursion flattening. In: Proceedings of the 18th ACM Great Lakes Symposium on VLSI, GLSVLSI \u201908, pp. 131\u2013134, New York, NY, USA (2008). Association for Computing Machinery. ISBN 9781595939999. https:\/\/doi.org\/10.1145\/1366110.1366143","DOI":"10.1145\/1366110.1366143"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Rugina, R., Rinard, M.: Recursion unrolling for divide and conquer programs. In: Samuel,\u00a0P., (eds.), Languages and Compilers for Parallel Computing Ed. Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 34\u201348 (2001). ISBN: 978-3-540-45574-5.","DOI":"10.1007\/3-540-45574-4_3"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-07612-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,23]],"date-time":"2025-11-23T17:57:21Z","timestamp":1763920641000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-07612-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,24]]},"ISBN":["9783032076113","9783032076120"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-07612-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,24]]},"assertion":[{"value":"24 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISC High Performance","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on High Performance Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hamburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"40","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"supercomputing2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}