{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T03:22:27Z","timestamp":1782876147307,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,5,28]]},"DOI":"10.1145\/3719276.3725197","type":"proceedings-article","created":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T05:00:46Z","timestamp":1751605246000},"page":"176-184","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Pattern Matching, Transformation and Code Replacement on a Polyhedral Representation of Nested Loops"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-7059-3555","authenticated-orcid":false,"given":"Benedikt","family":"Huber","sequence":"first","affiliation":[{"name":"Compilers and Languages, TU Wien, Vienna, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-7668-6259","authenticated-orcid":false,"given":"Andreas","family":"Krall","sequence":"additional","affiliation":[{"name":"Compilers and Languages, TU Wien, Vienna, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,7,4]]},"reference":[{"key":"e_1_3_3_2_2_2","unstructured":"Colby\u00a0R. Banbury Vijay\u00a0Janapa Reddi Peter Torelli Jeremy Holleman Nat Jeffries Csaba Kir\u00e1ly Pietro Montino David Kanter Sebastian Ahmed Danilo Pau Urmish Thakker Antonio Torrini Pete Warden Jay Cordaro Giuseppe\u00a0Di Guglielmo Javier\u00a0M. Duarte Stephen Gibellini Videet Parekh Honson Tran Nhan Tran Wenxu Niu and Xuesong Xu. 2021. MLPerf Tiny Benchmark. CoRR abs\/2106.07597 (2021). arXiv:https:\/\/arXiv.org\/abs\/2106.07597https:\/\/arxiv.org\/abs\/2106.07597"},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375595"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/PACT58117.2023.00012"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"publisher","unstructured":"Lorenzo Chelini Oleksandr Zinenko Tobias Grosser and Henk Corporaal. 2019. Declarative Loop Tactics for Domain-Specific Optimization. ACM Trans. Archit. and Code Optim. (TACO) 16 4 Article 55 (dec 2019) 25\u00a0pages. 10.1145\/3372266","DOI":"10.1145\/3372266"},{"key":"e_1_3_3_2_6_2","unstructured":"Aakanksha Chowdhery Pete Warden Jonathon Shlens Andrew Howard and Rocky Rhodes. 2019. Visual Wake Words Dataset. CoRR abs\/1906.05721 (2019). arXiv:https:\/\/arXiv.org\/abs\/1906.05721http:\/\/arxiv.org\/abs\/1906.05721"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"crossref","unstructured":"Joao\u00a0PL De\u00a0Carvalho Braedy Kuzma Ivan Korostelev Jos\u00e9\u00a0Nelson Amaral Christopher Barton Jos\u00e9 Moreira and Guido Araujo. 2021. KernelFaRer: Replacing Native-Code Idioms with High-Performance Library Calls. ACM Trans. Archit. and Code Optim. (TACO) 18 3 (2021) 1\u201322.","DOI":"10.1145\/3459010"},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"crossref","unstructured":"Vinicius Espindola Luciano Zago Herv\u00e9 Yviquel and Guido Araujo. 2023. Source Matching and Rewriting for MLIR Using String-Based Automata. ACM Trans. Archit. and Code Optim. (TACO) 20 2 (2023) 1\u201326.","DOI":"10.1145\/3571283"},{"key":"e_1_3_3_2_9_2","first-page":"1","volume-title":"Proceedings of the First International Workshop on Polyhedral Compilation Techniques (IMPACT)","volume":"2011","author":"Grosser Tobias","year":"2011","unstructured":"Tobias Grosser, Hongbin Zheng, Raghesh Aloor, Andreas Simb\u00fcrger, Armin Gr\u00f6\u00dflinger, and Louis-No\u00ebl Pouchet. 2011. Polly-Polyhedral Optimization in LLVM. In Proceedings of the First International Workshop on Polyhedral Compilation Techniques (IMPACT) , Vol.\u00a02011. 1."},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"crossref","unstructured":"Ralf Karrenberg and Ralf Karrenberg. 2015. Whole-Function Vectorization. Automatic SIMD vectorization of SSA-based control flow graphs (2015) 85\u2013125.","DOI":"10.1007\/978-3-658-10113-8_6"},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"crossref","unstructured":"Chris Lattner and Vikram Adve. 2004. LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation(CGO \u201904). IEEE Computer Society USA 75.","DOI":"10.1109\/CGO.2004.1281665"},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/CGO51591.2021.9370308"},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/3615338.3618125"},{"key":"e_1_3_3_2_14_2","unstructured":"Jie Qiu Colin Cai Sahil Bhatia Niranjan Hasabnis Sanjit\u00a0A Seshia and Alvin Cheung. 2024. Tenspiler: A Verified Lifting-Based Compiler for Tensor Operations. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2404.18249 (2024)."},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/3078633.3081039"},{"key":"e_1_3_3_2_16_2","first-page":"20","volume-title":"International Workshop on Polyhedral Compilation Techniques, Date","author":"Verdoolaege Sven","year":"2014","unstructured":"Sven Verdoolaege, Serge Guelton, Tobias Grosser, and Albert Cohen. 2014. Schedule Trees. In International Workshop on Polyhedral Compilation Techniques, Date , Vol.\u00a01. 20\u20132014."},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.5555\/572937"},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"crossref","unstructured":"Xingfu Wu Michael Kruse Prasanna Balaprakash Hal Finkel Paul Hovland Valerie Taylor and Mary Hall. 2022. Autotuning PolyBench benchmarks with LLVM Clang\/Polly loop optimization pragmas using Bayesian optimization. Concurrency and Computation: Practice and Experience 34 20 (2022) e6683.","DOI":"10.1002\/cpe.6683"}],"event":{"name":"CF '25: 22nd ACM International Conference on Computing Frontiers","location":"Cagliari Italy","acronym":"CF '25","sponsor":["SIGMICRO ACM Special Interest Group on Microarchitectural Research and Processing"]},"container-title":["Proceedings of the 22nd ACM International Conference on Computing Frontiers"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3719276.3725197","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T09:48:06Z","timestamp":1753091286000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3719276.3725197"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,28]]},"references-count":17,"alternative-id":["10.1145\/3719276.3725197","10.1145\/3719276"],"URL":"https:\/\/doi.org\/10.1145\/3719276.3725197","relation":{},"subject":[],"published":{"date-parts":[[2025,5,28]]},"assertion":[{"value":"2025-07-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}