{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:49Z","timestamp":1772164069766,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":56,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,1,11]],"date-time":"2016-01-11T00:00:00Z","timestamp":1452470400000},"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":[[2016,1,11]]},"DOI":"10.1145\/2837614.2837656","type":"proceedings-article","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T09:05:00Z","timestamp":1452157500000},"page":"539-554","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["PolyCheck: dynamic verification of iteration space transformations on affine programs"],"prefix":"10.1145","author":[{"given":"Wenlei","family":"Bao","sequence":"first","affiliation":[{"name":"Ohio State University, USA"}]},{"given":"Sriram","family":"Krishnamoorthy","sequence":"additional","affiliation":[{"name":"Pacific Northwest National Laboratory, USA"}]},{"given":"Louis-No\u00ebl","family":"Pouchet","sequence":"additional","affiliation":[{"name":"Ohio State University, USA"}]},{"given":"Fabrice","family":"Rastello","sequence":"additional","affiliation":[{"name":"Inria, France"}]},{"given":"P.","family":"Sadayappan","sequence":"additional","affiliation":[{"name":"Ohio State University, USA"}]}],"member":"320","published-online":{"date-parts":[[2016,1,11]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Clan the Chunky Loop Analyzer. http:\/\/icps.u-strasbg. fr\/\u02dcbastoul.  Clan the Chunky Loop Analyzer. http:\/\/icps.u-strasbg. fr\/\u02dcbastoul."},{"key":"e_1_3_2_1_2_1","unstructured":"GNU GCC. http:\/\/gcc.gnu.org.  GNU GCC. http:\/\/gcc.gnu.org."},{"key":"e_1_3_2_1_3_1","unstructured":"ISA 0.13. http:\/\/repo.or.cz\/w\/isa.git.  ISA 0.13. http:\/\/repo.or.cz\/w\/isa.git."},{"key":"e_1_3_2_1_4_1","unstructured":"ISL the Integer Set Library. http:\/\/repo.or.cz\/w\/isl.git.  ISL the Integer Set Library. http:\/\/repo.or.cz\/w\/isl.git."},{"key":"e_1_3_2_1_5_1","unstructured":"LLVM. http:\/\/llvm.org.  LLVM. http:\/\/llvm.org."},{"key":"e_1_3_2_1_6_1","unstructured":"MIT Cilk. http:\/\/supertech.csail.mit.edu\/cilk.  MIT Cilk. http:\/\/supertech.csail.mit.edu\/cilk."},{"key":"e_1_3_2_1_7_1","unstructured":"PoCC the Polyhedral Compiler Collection 1.3. http:\/\/pocc. sourceforge.net.  PoCC the Polyhedral Compiler Collection 1.3. http:\/\/pocc. sourceforge.net."},{"key":"e_1_3_2_1_8_1","unstructured":"PolyBench\/C 3.2. http:\/\/polybench.sourceforge.net.  PolyBench\/C 3.2. http:\/\/polybench.sourceforge.net."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(05)82599-X"},{"key":"e_1_3_2_1_10_1","first-page":"15","article-title":"Polycheck: Dynamic verification of iteration space transformations on affine programs. Technical report","author":"Bao W.","year":"2015","unstructured":"W. Bao , S. Krishnamoorthy , L.-N. Pouchet , F. Rastello , and P. Sadayappan . Polycheck: Dynamic verification of iteration space transformations on affine programs. Technical report , OSU\/PNNL\/INRIA , Nov. 2015 . OSU-CISRC-11\/ 15 -TR21. W. Bao, S. Krishnamoorthy, L.-N. Pouchet, F. Rastello, and P. Sadayappan. Polycheck: Dynamic verification of iteration space transformations on affine programs. Technical report, OSU\/PNNL\/INRIA, Nov. 2015. OSU-CISRC-11\/15-TR21.","journal-title":"OSU\/PNNL\/INRIA"},{"key":"e_1_3_2_1_11_1","volume-title":"Euro-Par 2002 Parallel Processing.","author":"Barthou D.","year":"2002","unstructured":"D. Barthou , P. Feautrier , and X. Redon . On the equivalence of two systems of affine recurrence equations . In Euro-Par 2002 Parallel Processing. 2002 . D. Barthou, P. Feautrier, and X. Redon. On the equivalence of two systems of affine recurrence equations. In Euro-Par 2002 Parallel Processing. 2002."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772954.1772983"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1025127.1025992"},{"key":"e_1_3_2_1_14_1","first-page":"53","volume-title":"OpenMP in the Petascale Era","author":"Basupalli V.","unstructured":"V. Basupalli , T. Yuki , S. Rajopadhye , A. Morvan , S. Derrien , P. Quinton , and D. Wonnacott . ompVerify: polyhedral analysis for the OpenMP programmer . In OpenMP in the Petascale Era , pages 37\u2013 53 . Springer, 2011. V. Basupalli, T. Yuki, S. Rajopadhye, A. Morvan, S. Derrien, P. Quinton, and D. Wonnacott. ompVerify: polyhedral analysis for the OpenMP programmer. In OpenMP in the Petascale Era, pages 37\u2013 53. Springer, 2011."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390630.1390634"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007933"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324234"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/209936.209958"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/209937.209958"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375595"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/49418"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01407835"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542490"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1088149.1088197"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-007-9098-2"},{"key":"e_1_3_2_1_26_1","volume-title":"Proc. of the 40th Annual Symposium on Foundations of Computer Science. IEEE","author":"Frigo M.","year":"1999","unstructured":"M. Frigo , C. E. Leiserson , H. Prokop , and S. Ramachandran . Cacheoblivious algorithms . In Proc. of the 40th Annual Symposium on Foundations of Computer Science. IEEE , 1999 . M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cacheoblivious algorithms. In Proc. of the 40th Annual Symposium on Foundations of Computer Science. IEEE, 1999."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/318789.318815"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-006-0012-3"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-008-0075-2"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007516818651"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00768-2_24"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516507.1516509"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2013.2272536"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1543135.1542513"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14052-5_26"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103701"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/358438.349314"},{"key":"e_1_3_2_1_38_1","unstructured":"L. C. Paulson. Isabelle Page. https:\/\/www.cl.cam.ac.uk\/ research\/hvg\/Isabelle.  L. C. Paulson. Isabelle Page. https:\/\/www.cl.cam.ac.uk\/ research\/hvg\/Isabelle."},{"key":"e_1_3_2_1_39_1","volume-title":"A polyhedral optimizer for the rose compiler","author":"Pouchet L.","year":"2011","unstructured":"L. Pouchet . Polyopt\/C : A polyhedral optimizer for the rose compiler , 2011 . L. Pouchet. Polyopt\/C: A polyhedral optimizer for the rose compiler, 2011."},{"key":"e_1_3_2_1_40_1","volume-title":"Massachusetts Institute of Technology","author":"Prokop H.","year":"1999","unstructured":"H. Prokop . Cache-oblivious algorithms. PhD thesis , Massachusetts Institute of Technology , 1999 . H. Prokop. Cache-oblivious algorithms. PhD thesis, Massachusetts Institute of Technology, 1999."},{"key":"e_1_3_2_1_41_1","unstructured":"D. Quinlan C. Liao R. Matzke M. Schordan T. Panas R. Vuduc and Q. Yi. ROSE Web Page. http:\/\/www.rosecompiler.org 2014.  D. Quinlan C. Liao R. Matzke M. Schordan T. Panas R. Vuduc and Q. Yi. ROSE Web Page. http:\/\/www.rosecompiler.org 2014."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02477176"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/21095.21125"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254064.2254127"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/265924.265927"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45231-8_41"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37036-6_31"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2014.29"},{"key":"e_1_3_2_1_49_1","volume-title":"Poster session presented at the 3rd USENIX Workshop on Hot Topics in Parallelism","author":"Tang Y.","year":"2011","unstructured":"Y. Tang , R. Chowdhury , C.-K. Luk , and C. E. Leiserson . Coding stencil computations using the pochoir stencil-specification language . In Poster session presented at the 3rd USENIX Workshop on Hot Topics in Parallelism , 2011 . Y. Tang, R. Chowdhury, C.-K. Luk, and C. E. Leiserson. Coding stencil computations using the pochoir stencil-specification language. In Poster session presented at the 3rd USENIX Workshop on Hot Topics in Parallelism, 2011."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989508"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.5555\/1888390.1888455"},{"key":"e_1_3_2_1_52_1","volume-title":"The 1st International Workshop on Polyhedral Compilation Techniques (IMPACT\u201911)","author":"Verdoolaege S.","year":"2011","unstructured":"S. Verdoolaege . Counting affine calculator and applications . In The 1st International Workshop on Polyhedral Compilation Techniques (IMPACT\u201911) , 2011 . S. Verdoolaege. Counting affine calculator and applications. In The 1st International Workshop on Polyhedral Compilation Techniques (IMPACT\u201911), 2011."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-006-1231-0"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2362389.2362390"},{"key":"e_1_3_2_1_55_1","volume-title":"High Performance Compilers for Parallel Computing","author":"Wolfe M.","year":"1996","unstructured":"M. Wolfe . High Performance Compilers for Parallel Computing . Addison-Wesley , 1996 . M. Wolfe. High Performance Compilers for Parallel Computing. Addison-Wesley, 1996."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.5555\/2555692.2555707"}],"event":{"name":"POPL '16: The 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"St. Petersburg FL USA","acronym":"POPL '16","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2837614.2837656","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2837614.2837656","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:43:38Z","timestamp":1750211018000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2837614.2837656"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,11]]},"references-count":56,"alternative-id":["10.1145\/2837614.2837656","10.1145\/2837614"],"URL":"https:\/\/doi.org\/10.1145\/2837614.2837656","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2914770.2837656","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016,1,11]]},"assertion":[{"value":"2016-01-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}