{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:10:35Z","timestamp":1778213435686,"version":"3.51.4"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032236036","type":"print"},{"value":"9783032236043","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-23604-3_3","type":"book-chapter","created":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T03:20:48Z","timestamp":1778210448000},"page":"35-51","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["EvoTADASHI: Genetic Programming for\u00a0High-Performance Code Optimization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2997-8550","authenticated-orcid":false,"given":"Jo\u00e3o Eduardo","family":"Batista","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7494-5048","authenticated-orcid":false,"given":"Emil","family":"Vatai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksandr","family":"Drozd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7165-2095","authenticated-orcid":false,"given":"Mohamed","family":"Wahib","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,9]]},"reference":[{"key":"3_CR1","volume-title":"Compilers: Principles, Techniques, & Tools","author":"AV Aho","year":"2007","unstructured":"Aho, A.V., Lam, M.S., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, & Tools, 2nd edn. Pearson\/Addison Wesley, Boston (2007)","edition":"2"},{"key":"3_CR2","unstructured":"Baghdadi, R., et al.: A deep learning based cost model for automatic code optimization. In: Smola, A., Dimakis, A., Stoica, I. (eds.) Proceedings of Machine Learning and Systems, vol.\u00a03, pp. 181\u2013193 (2021)"},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"Bastoul, C.: Code generation in the polyhedral model is easier than you think. In: Proceedings. 13th International Conference on Parallel Architecture and Compilation Techniques, 2004. PACT 2004, pp. 7\u201316. IEEE, Antibes Juan-les-Pins (2004). https:\/\/doi.org\/10.1109\/PACT.2004.1342537","DOI":"10.1109\/PACT.2004.1342537"},{"key":"3_CR4","unstructured":"Batista, J.E.: Machine Learning for TADASHI\u2019s Github Repository. https:\/\/github.com\/jespb\/ML4TADASHI. Accessed 15 Jan 2026"},{"key":"3_CR5","unstructured":"Ben-Nun, T., Jakobovits, A.S., Hoefler, T.: Neural code comprehension: a learnable representation of code semantics. In: Proceedings of the 32nd International Conference on Neural Information Processing Systems, NIPS\u201918, pp. 3589\u20133601. Curran Associates Inc., Red Hook (Dec 2018)"},{"key":"3_CR6","unstructured":"Bendib, N., Aouadj, I.N., Baghdadi, R.: A Reinforcement Learning Environment for Automatic Code Optimization in the MLIR Compiler (2024). https:\/\/arxiv.org\/abs\/2409.11068"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Bondhugula, U., Hartono, A., Ramanujam, J., Sadayappan, P.: A practical automatic polyhedral parallelizer and locality optimizer, p.\u00a013 (2008)","DOI":"10.1145\/1375581.1375595"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Coignion, T., Quinton, C., Rouvoy, R.: A performance study of LLM-generated code on leetcode. In: Proceedings of the 28th International Conference on Evaluation and Assessment in Software Engineering, EASE \u201924, pp. 79\u201389. Association for Computing Machinery, New York (2024)","DOI":"10.1145\/3661167.3661221"},{"key":"3_CR9","doi-asserted-by":"publisher","unstructured":"Cummins, C., Fisches, Z.V., Ben-Nun, T., Hoefler, T., Leather, H.: ProGraML: graph-based deep learning for program optimization and analysis (2020). https:\/\/doi.org\/10.48550\/arXiv.2003.10536","DOI":"10.48550\/arXiv.2003.10536"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"82434","DOI":"10.1109\/ACCESS.2022.3196347","volume":"10","author":"E Dehaerne","year":"2022","unstructured":"Dehaerne, E., Dey, B., Halder, S., De Gendt, S., Meert, W.: Code generation using machine learning: a systematic review. IEEE Access 10, 82434\u201382455 (2022). https:\/\/doi.org\/10.1109\/ACCESS.2022.3196347","journal-title":"IEEE Access"},{"key":"3_CR11","unstructured":"Emil Vatai: TADASHI\u2019s Github Repository. https:\/\/github.com\/vatai\/tadashi. Accessed 15 Nov 2025"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Feautrier, P.: Dataflow Analysis of Array and Scalar References, p.\u00a037 (1991). introduction of SCoP","DOI":"10.1007\/BF01407931"},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"Feautrier, P.: Some efficient solutions to the affine scheduling problem part I one-dimensional time. Int. J. Parallel Program. 21 (1996). https:\/\/doi.org\/10.1007\/BF01407835","DOI":"10.1007\/BF01407835"},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"Feautrier, P.: Some efficient solutions to the affine scheduling problem part II multidimensional time. Int. J. Parallel Program. 21 (1997). https:\/\/doi.org\/10.1007\/BF01379404","DOI":"10.1007\/BF01379404"},{"key":"3_CR15","unstructured":"Github: GitHub Copilot $$\\cdot $$ Your AI pair programmer (2022). https:\/\/github.com\/features\/copilot"},{"issue":"04","key":"3_CR16","doi-asserted-by":"publisher","first-page":"1250010","DOI":"10.1142\/S0129626412500107","volume":"22","author":"T Grosser","year":"2012","unstructured":"Grosser, T., Groesslinger, A., Lengauer, C.: Polly - performing polyhedral optimizations on a low-level intermediate representation. Parallel Process. Lett. 22(04), 1250010 (2012). https:\/\/doi.org\/10.1142\/S0129626412500107","journal-title":"Parallel Process. Lett."},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"Hemberg, E., Moskal, S., O\u2019Reilly, U.M.: Evolving code with a large language model. Genetic Program. Evol. Mach. 25(2) (2024). https:\/\/doi.org\/10.1007\/s10710-024-09494-2","DOI":"10.1007\/s10710-024-09494-2"},{"key":"3_CR18","doi-asserted-by":"publisher","unstructured":"Jiang, J., Wang, F., Shen, J., Kim, S., Kim, S.: A survey on large language models for code generation (2025). https:\/\/doi.org\/10.1145\/3747588","DOI":"10.1145\/3747588"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Lehman, J., Stanley, K.O.: Novelty search and the problem with objectives. In: Genetic Programming Theory and Practice IX, pp. 37\u201356. Springer, Heidelberg (2011)","DOI":"10.1007\/978-1-4614-1770-5_3"},{"issue":"7964","key":"3_CR20","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1038\/s41586-023-06004-9","volume":"618","author":"DJ Mankowitz","year":"2023","unstructured":"Mankowitz, D.J., et al.: Faster sorting algorithms discovered using deep reinforcement learning. Nature 618(7964), 257\u2013263 (2023). https:\/\/doi.org\/10.1038\/s41586-023-06004-9","journal-title":"Nature"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-031-40744-4_3","volume-title":"OpenMP: Advanced Task-Based, Device and Compiler Programming","author":"A Mishra","year":"2023","unstructured":"Mishra, A., Malik, A.M., Lin, M., Chapman, B.: Openmp advisor: a compiler tool for heterogeneous architectures. In: McIntosh-Smith, S., Klemm, M., de Supinski, B.R., Deakin, T., Klinkenberg, J. (eds.) OpenMP: Advanced Task-Based, Device and Compiler Programming, pp. 34\u201348. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-40744-4_3"},{"key":"3_CR22","doi-asserted-by":"publisher","unstructured":"Munoz, M., Torre, J., Lopez, S., Herrera, S., Uribe, C.: Comparative study of AI code generation tools: quality assessment and performance analysis. LatIA 2, 104 (2024). https:\/\/doi.org\/10.62486\/latia2024104","DOI":"10.62486\/latia2024104"},{"key":"3_CR23","unstructured":"OpenMP Architecture Review Board: OpenMP Application Programming Interface Version 5.2. OpenMP Architecture Review Board (2021). https:\/\/www.openmp.org\/specifications\/"},{"key":"3_CR24","unstructured":"Phan, H.: Self Learning from Large Scale Code Corpus to Infer Structure of Method Invocations (2019). https:\/\/arxiv.org\/abs\/1909.03147v1"},{"key":"3_CR25","unstructured":"Rahman, A., et al.: MARCO: Multi-Agent Code Optimization with Real-Time Knowledge Integration for High-Performance Computing (2025). https:\/\/arxiv.org\/abs\/2505.03906"},{"key":"3_CR26","unstructured":"Reisinger, M.: MatthiasJReisinger\/PolyBenchC-4.2.1 (2024). https:\/\/github.com\/MatthiasJReisinger\/PolyBenchC-4.2.1"},{"key":"3_CR27","doi-asserted-by":"publisher","unstructured":"Rosas, M.R., Miguel Torres Sanchez, Eigenmann, R.: Should AI Optimize Your Code? A Comparative Study of Current Large Language Models Versus Classical Optimizing Compilers (2024). https:\/\/doi.org\/10.48550\/arXiv.2406.12146, comment: 11 pages, 10 figures, under review for The International Symposium on Code Generation and Optimization (CGO) 2025, Las Vegas","DOI":"10.48550\/arXiv.2406.12146"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Shido, Y., Kobayashi, Y., Yamamoto, A., Miyamoto, A., Matsumura, T.: Automatic source code summarization with extended tree-LSTM. In: 2019 International Joint Conference on Neural Networks (IJCNN), pp.\u00a01\u20138 (2019)","DOI":"10.1109\/IJCNN.2019.8851751"},{"key":"3_CR29","doi-asserted-by":"publisher","unstructured":"Stein, A.J., Kapllani, L., Mancoridis, S., Greenstadt, R.: Exploring paraphrasing techniques on formal language for generating semantics preserving source code transformations. In: 2020 IEEE 14th International Conference on Semantic Computing (ICSC), pp. 242\u2013248 (2020). https:\/\/doi.org\/10.1109\/ICSC.2020.00051","DOI":"10.1109\/ICSC.2020.00051"},{"key":"3_CR30","unstructured":"Vatai, E., Drozd, A., Ivanov, I.R., Batista, J.E., Ren, Y., Wahib, M.: Tadashi: enabling AI-based automated code generation with guaranteed correctness (2025). https:\/\/arxiv.org\/abs\/2410.03210"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Verdoolaege, S., Carlos\u00a0Juega, J., Cohen, A., Ignacio\u00a0G\u00f3mez, J., Tenllado, C., Catthoor, F.: Polyhedral parallel code generation for CUDA. ACM Trans. Arch. Code Optim. 9(4), 54:1\u201354:23 (2013)","DOI":"10.1145\/2400682.2400713"},{"key":"3_CR32","unstructured":"Zheng, Z., et al.: VecTrans: enhancing compiler auto-vectorization through LLM-assisted code transformations (2025). https:\/\/arxiv.org\/abs\/2503.19449"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-23604-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T03:20:56Z","timestamp":1778210456000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-23604-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032236036","9783032236043"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-23604-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"9 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoApplications","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Applications of Evolutionary Computation (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoapplications2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2026\/evoapps\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}