{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T17:12:55Z","timestamp":1771953175577,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,2,24]],"date-time":"2018-02-24T00:00:00Z","timestamp":1519430400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,2,24]]},"DOI":"10.1145\/3178372.3179529","type":"proceedings-article","created":{"date-parts":[[2018,2,21]],"date-time":"2018-02-21T16:46:16Z","timestamp":1519231576000},"page":"25-36","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Polyhedral expression propagation"],"prefix":"10.1145","author":[{"given":"Johannes","family":"Doerfert","sequence":"first","affiliation":[{"name":"Saarland University, Germany"}]},{"given":"Shrey","family":"Sharma","sequence":"additional","affiliation":[{"name":"Saarland University, Germany"}]},{"given":"Sebastian","family":"Hack","sequence":"additional","affiliation":[{"name":"Saarland University, Germany"}]}],"member":"320","published-online":{"date-parts":[[2018,2,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","unstructured":"Riyadh Baghdadi Albert Cohen Sven Verdoolaege and Konrad Trifunovi\u0107. 2013. Improved Loop Tiling Based on the Removal of Spurious False Dependences. ACM Trans. Archit. Code Optim. (2013). 10.1145\/2400682.2400711","DOI":"10.1145\/2400682.2400711"},{"key":"e_1_3_2_1_2_1","unstructured":"Soufiane Baghdadi Armin Gr\u00f6\u00dflinger and Albert Cohen. 2010. Putting Automatic Polyhedral Compilation for GPGP U to Work (CPC\u201910)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","unstructured":"Vinayaka Bandishti Irshad Pananilath and Uday Bondhugula. 2012. Tiling Stencil Computations to Maximize Parallelism (ICS\u201912).","DOI":"10.5555\/2388996.2389051"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"C\u00e9dric Bastoul Albert Cohen Sylvain Girbal Saurabh Sharma and Olivier Temam. 2003. Putting polyhedral loop transformations to work. In Languages and Compilers for Parallel Computing.","DOI":"10.1007\/978-3-540-24644-2_14"},{"key":"e_1_3_2_1_5_1","volume-title":"Julia: A fast dynamic language for technical computing. arXiv","author":"Bezanson Jeff","year":"2012","unstructured":"Jeff Bezanson, Stefan Karpinski, Viral B Shah, and Alan Edelman. 2012. Julia: A fast dynamic language for technical computing. arXiv (2012)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2837614.2837636"},{"key":"e_1_3_2_1_7_1","unstructured":"OpenMP Architecture Review Boards. 2017. The OpenMP API specification for parallel programming. http:\/\/www.openmp.org\/ . (2017)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","unstructured":"Uday Bondhugula Oktay Gunluk Sanjeeb Dash and Lakshminarayanan Renganarayanan. 2010. A Model for Fusion and Code Motion in an Automatic Parallelizing Compiler (PACT\u201910). 10.1145\/1854273.1854317","DOI":"10.1145\/1854273.1854317"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","unstructured":"Uday Bondhugula Albert Hartono J. Ramanujam and P. Sadayappan. 2008. A Practical Automatic Polyhedral Parallelizer and Locality Optimizer (PLDI\u201908). 10.1145\/1375581.1375595","DOI":"10.1145\/1375581.1375595"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","unstructured":"Pierre-Yves Calland Alain Darte Yves Robert and Fr\u00e9d\u00e9ric Vivien. 1997. Plugging anti and output dependence removal techniques into loop parallelization algorithm. Parallel Comput. (1997). 10.1016\/S0167-8191(96)00108-1","DOI":"10.1016\/S0167-8191(96)00108-1"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","unstructured":"Patrick Cousot and Nicolas Halbwachs. 1978. Automatic Discovery of Linear Restraints Among Variables of a Program (POPL\u201978). 10.1145\/512760.512770","DOI":"10.1145\/512760.512770"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","unstructured":"Alain Darte Alexandre Isoard and Tomofumi Yuki. 2016. Extended Lattice-based Memory Allocation (CC\u201916). 10.1145\/2892208.2892213","DOI":"10.1145\/2892208.2892213"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2005.167"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","unstructured":"Johannes Doerfert Tobias Grosser and Sebastian Hack. 2017. Optimistic Loop Optimization (CGO\u201917).","DOI":"10.1109\/CGO.2017.7863748"},{"key":"e_1_3_2_1_15_1","unstructured":"Johannes Doerfert Kevin Streit Sebastian Hack and Zino Benaissa. 2015. Polly\u2019s Polyhedral Scheduling in the Presence of Reductions (IMPACT\u201915)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/173262.155097"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","unstructured":"P. Feautrier. 1988. Array Expansion (ICS\u201988). 10.1145\/55364.55406","DOI":"10.1145\/55364.55406"},{"key":"e_1_3_2_1_18_1","volume-title":"Int. J. of Parallel Programming","author":"Feautrier Paul","year":"1991","unstructured":"Paul Feautrier. 1991. Dataflow analysis of array and scalar references. Int. J. of Parallel Programming (1991)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01407835"},{"key":"e_1_3_2_1_20_1","volume-title":"Int. J. Parallel Program.","author":"Feautrier P.","year":"1992","unstructured":"P. Feautrier. 1992. Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time. Int. J. Parallel Program. (1992)."},{"key":"e_1_3_2_1_21_1","volume-title":"Encyclopedia of Parallel Computing.","author":"Feautrier Paul","unstructured":"Paul Feautrier and Christian Lengauer. 2011. Polyhedron Model. In Encyclopedia of Parallel Computing."},{"key":"e_1_3_2_1_22_1","volume-title":"Int. J. Parallel Program.","author":"Griebl Martin","year":"2000","unstructured":"Martin Griebl, Paul Feautrier, and Christian Lengauer. 2000. Index Set Splitting. Int. J. Parallel Program. (2000)."},{"key":"e_1_3_2_1_23_1","volume-title":"Polly \u2013 Performing polyhedral optimizations on a low-level intermediate representation. Parallel Processing Letters","author":"Grosser Tobias","year":"2012","unstructured":"Tobias Grosser, Armin Gr\u00f6\u00dflinger, and Christian Lengauer. 2012. Polly \u2013 Performing polyhedral optimizations on a low-level intermediate representation. Parallel Processing Letters (2012)."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","unstructured":"T. Grosser and T. Hoefler. 2016. Polly-ACC: Transparent compilation to heterogeneous hardware (ICS\u201916). 10.1145\/2925426.2926286","DOI":"10.1145\/2925426.2926286"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","unstructured":"Tobias Grosser J. Ramanujam Louis-Noel Pouchet P. Sadayappan and Sebastian Pop. 2015. Optimistic Delinearization of Parametrically Sized Arrays (ICS\u201915). 10.1145\/2751205.2751248","DOI":"10.1145\/2751205.2751248"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","unstructured":"Tobias Grosser Sven Verdoolaege and Albert Cohen. 2015. Polyhedral AST Generation Is More Than Scanning Polyhedra. ACM Trans. Program. Lang. Syst. (2015). 10.1145\/2743016","DOI":"10.1145\/2743016"},{"key":"e_1_3_2_1_27_1","volume-title":"Kerncraft: A Tool for Analytic Performance Modeling of Loop Kernels. Computing Research Repository (CoRR)","author":"Hammer Julian","year":"2017","unstructured":"Julian Hammer, Jan Eitzinger, Georg Hager, and Gerhard Wellein. 2017. Kerncraft: A Tool for Analytic Performance Modeling of Loop Kernels. Computing Research Repository (CoRR) (2017)."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","unstructured":"James Hegarty John Brunhaver Zachary DeVito Jonathan RaganKelley Noy Cohen Steven Bell Artem Vasilyev Mark Horowitz and Pat Hanrahan. 2014. Darkroom: compiling high-level image processing code into hardware pipelines. ACM Trans. Graph. (2014). 10.1145\/2601097.2601174","DOI":"10.1145\/2601097.2601174"},{"key":"e_1_3_2_1_29_1","unstructured":"F. Irigoin and R. Triolet. 1987. Computing dependence direction vectors and dependence cones with linear systems. Tech. Rep."},{"key":"e_1_3_2_1_30_1","volume-title":"Predictive Commoning: A method of optimizing loops containing references to consecutive array elements. Technical Report","author":"O\u2019Brien Kevin","year":"1990","unstructured":"Kevin O\u2019Brien. 1990. Predictive Commoning: A method of optimizing loops containing references to consecutive array elements. Technical Report. IBM Thomas J. Watson Research Center."},{"key":"e_1_3_2_1_31_1","unstructured":"Bart Kienhuis. 2000. MatParser: An array dataflow analysis compiler."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","unstructured":"Jens Knoop Oliver R\u00fcthing and Bernhard Steffen. 1994. Partial Dead Code Elimination (PLDI\u201994). 10.1145\/178243.178256","DOI":"10.1145\/178243.178256"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462187"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/977395.977673"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","unstructured":"Vincent Lefebvre and Paul Feautrier. 1997. Optimizing Storage Size for Static Control Programs in Automatic Parallelizers (Euro-Par\u201997).","DOI":"10.5555\/646662.699547"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/158511.158515"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2963101"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","unstructured":"Simon Moll Johannes Doerfert and Sebastian Hack. 2016. Input Space Splitting for OpenCL (CC\u201916). 10.1145\/2892208.2892217","DOI":"10.1145\/2892208.2892217"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","unstructured":"Ravi Teja Mullapudi Andrew Adams Dillon Sharlet Jonathan RaganKelley and Kayvon Fatahalian. 2016. Automatically Scheduling Halide Image Processing Pipelines. ACM Trans. Graph. (2016). 10.1145\/2897824.2925952","DOI":"10.1145\/2897824.2925952"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Ravi Teja Mullapudi Vinay Vasista and Uday Bondhugula. 2015. PolyMage: Automatic Optimization for Image Processing Pipelines (ASP-LOS\u201915).","DOI":"10.1145\/2694344.2694364"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","unstructured":"Louis-Noel Pouchet Peng Zhang P. Sadayappan and Jason Cong. 2013. Polyhedral-based Data Reuse Optimization for Configurable Computing (FPGA\u201913). 10.1145\/2435264.2435273","DOI":"10.1145\/2435264.2435273"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","unstructured":"William Pugh and David Wonnacott. 1993. An Exact Method for Analysis of Value-based Array Data Dependences (LCPC\u201993).","DOI":"10.5555\/645671.665398"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","unstructured":"Jonathan Ragan-Kelley Andrew Adams Sylvain Paris Marc Levoy Saman Amarasinghe and Fr\u00e9do Durand. 2012. Decoupling Algorithms from Schedules for Easy Optimization of Image Processing Pipelines. ACM Trans. Graph. (2012). 10.1145\/2185520.2185528","DOI":"10.1145\/2185520.2185528"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462176"},{"key":"e_1_3_2_1_45_1","unstructured":"Uday Bondhugula Ravi Teja Mullapudi Vinay Vasista. 2017. PolyMage benchmarks. http:\/\/mcl.csa.iisc.ac.in\/polymage.html . (2017)."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","unstructured":"Silvius Rus Guobin He and Lawrence Rauchwerger. 2005. Scalable Array SSA and Array Data Flow Analysis (LCPC\u201905). 10.1007\/978-3-540-69330-7_27","DOI":"10.1007\/978-3-540-69330-7_27"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Vivek Sarkar and Kathleen Knobe. 1998. Enabling Sparse Constant Propagation of Array Elements via Array SSA Form (SAS\u201998).","DOI":"10.1007\/3-540-49727-7_3"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","unstructured":"Tingting Sha M. M. K. Martin and A. Roth. 2005. Scalable store-load forwarding via store queue index prediction (MICRO\u201905). 10.1109\/MICRO.2005.29","DOI":"10.1109\/MICRO.2005.29"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","unstructured":"Jun Shirako Akihiro Hayashi and Vivek Sarkar. 2017. Optimized Two-level Parallelization for GP U Accelerators Using the Polyhedral Model (CC\u201917). 10.1145\/3033019.3033022","DOI":"10.1145\/3033019.3033022"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","unstructured":"Konrad Trifunovi\u0107 Dorit Nuzman Albert Cohen Ayal Zaks and Ira Rosen. 2009. Polyhedral-Model Guided Loop-Nest Auto-Vectorization (PACT\u201909). 10.1109\/PACT.2009.18","DOI":"10.1109\/PACT.2009.18"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","unstructured":"Peter Vanbroekhoven Gerda Janssens Maurice Bruynooghe Henk Corporaal and Francky Catthoor. 2003. Advanced Copy Propagation for Arrays (LCTES\u201903). 10.1145\/780732.780736","DOI":"10.1145\/780732.780736"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","unstructured":"Sven Verdoolaege. 2010. isl: An Integer Set Library for the Polyhedral Model (ICMS \u201910).","DOI":"10.5555\/1888390.1888455"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2400682.2400713"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.5555\/646668.700629"},{"key":"e_1_3_2_1_56_1","unstructured":"David Wonnacott. 1999. Constant Propagation Through Array Variables."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","unstructured":"David Wonnacott. 2000. Extending Scalar Optimizations for Arrays (LCPC\u201900).","DOI":"10.5555\/645678.663949"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","unstructured":"Tomofumi Yuki Paul Feautrier Sanjay Rajopadhye and Vijay Saraswat. 2013. Array Dataflow Analysis for Polyhedral X10 Programs (PPoPP). 10.1145\/2442516.2442520","DOI":"10.1145\/2442516.2442520"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","unstructured":"Tomofumi Yuki Lakshminarayanan Renganarayanan Sanjay Rajopadhye Charles Anderson Alexandre E Eichenberger and Kevin O\u2019Brien. 2010. Automatic creation of tile size selection models (CGO\u201910). 10.1145\/1772954.1772982","DOI":"10.1145\/1772954.1772982"}],"event":{"name":"CGO '18: 16th Annual IEEE\/ACM International Symposium on Code Generation and Optimization","location":"Vienna Austria","acronym":"CGO '18","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGMICRO ACM Special Interest Group on Microarchitectural Research and Processing","IEEE-CS Computer Society"]},"container-title":["Proceedings of the 27th International Conference on Compiler Construction"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3178372.3179529","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3178372.3179529","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:26:23Z","timestamp":1750213583000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3178372.3179529"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,24]]},"references-count":58,"alternative-id":["10.1145\/3178372.3179529","10.1145\/3178372"],"URL":"https:\/\/doi.org\/10.1145\/3178372.3179529","relation":{},"subject":[],"published":{"date-parts":[[2018,2,24]]},"assertion":[{"value":"2018-02-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}