{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:10Z","timestamp":1772164030538,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":60,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,1,23]],"date-time":"2013-01-23T00:00:00Z","timestamp":1358899200000},"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":[[2013,1,23]]},"DOI":"10.1145\/2429069.2429127","type":"proceedings-article","created":{"date-parts":[[2013,1,22]],"date-time":"2013-01-22T10:29:29Z","timestamp":1358850569000},"page":"483-496","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra"],"prefix":"10.1145","author":[{"given":"Ramakrishna","family":"Upadrasta","sequence":"first","affiliation":[{"name":"INRIA and LRI, Universit\u00e9 Paris-Sud (11), Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Albert","family":"Cohen","sequence":"additional","affiliation":[{"name":"INRIA and \u00c9cole Normale Sup\u00e9rieure, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,1,23]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Network flows: theory, algorithms, and applications","author":"Ahuja R. K.","year":"1993","unstructured":"R. K. Ahuja , T. L. Magnanti , and J. B. Orlin . Network flows: theory, algorithms, and applications . Prentice-Hall, Inc. , NJ , USA, 1993 . R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network flows: theory, algorithms, and applications. Prentice-Hall, Inc., NJ, USA, 1993."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/29873.29875"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/297096.297136"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/0209063"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2007.08.001"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-009-0073-1"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/73141.74822"},{"key":"e_1_3_2_2_8_1","volume-title":"Loop Transformations for Restructuring Compilers: The Foundations","author":"Banerjee U.","year":"1992","unstructured":"U. Banerjee . Loop Transformations for Restructuring Compilers: The Foundations . Kluwer Academic Publishers , Boston , 1992 . U. Banerjee. Loop Transformations for Restructuring Compilers: The Foundations. Kluwer Academic Publishers, Boston, 1992."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/102435"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11970-5_16"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.50.1.3.17780"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/781131.781153"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375595"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.655240"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498698.1537602"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791256325"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-009-0089-6"},{"key":"e_1_3_2_2_18_1","volume-title":"Linear Programming and Extensions","author":"Dantzig G. B.","year":"1963","unstructured":"G. B. Dantzig . Linear Programming and Extensions . Princeton University Press , Princeton, NJ , 1963 . G. B. Dantzig. Linear Programming and Extensions. Princeton University Press, Princeton, NJ, 1963."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007506711786"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/646516.696302"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/556139"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025168022993"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(89)90133-3"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/1988220302431"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01407835"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01407835"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-006-0011-4"},{"key":"e_1_3_2_2_28_1","volume-title":"Flows in Networks","author":"Ford L. R.","year":"1962","unstructured":"L. R. Ford , Jr. and D. R. Fulkerson . Flows in Networks . Princeton University Press , 1962 . L. R. Ford, Jr. and D. R. Fulkerson. Flows in Networks. Princeton University Press, 1962."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/11596110_2"},{"key":"e_1_3_2_2_30_1","volume-title":"Pouchet. Polly - Polyhedral Optimization in LLVM. In IMPACT 2011, in conjunction with CGO 2011","author":"Grosser T.","year":"2011","unstructured":"T. Grosser , H. Zheng , A. Raghesh , A. Simb\u00fcrger , A. Gr\u00f6\u00dflinger , and L.- N. Pouchet. Polly - Polyhedral Optimization in LLVM. In IMPACT 2011, in conjunction with CGO 2011 , Chamonix, France , Apr 2011 . T. Grosser, H. Zheng, A. Raghesh, A. Simb\u00fcrger, A. Gr\u00f6\u00dflinger, and L.-N. Pouchet. Polly - Polyhedral Optimization in LLVM. In IMPACT 2011, in conjunction with CGO 2011, Chamonix, France, Apr 2011."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-006-0013-2"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793251876"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"crossref","unstructured":"J.\n      Jaffar M. J.\n      Maher P. J.\n      Stuckey and \n      R. H. C.\n      Yap\n    .\n  Beyond finite domains\n  . In A. Borning editor PPCP volume \n  874\n   of \n  Lecture Notes in Computer Science pages \n  86\n  --\n  94\n  . \n  Springer 1994\n  .   J. Jaffar M. J. Maher P. J. Stuckey and R. H. C. Yap. Beyond finite domains. In A. Borning editor PPCP volume 874 of Lecture Notes in Computer Science pages 86--94. Springer 1994.","DOI":"10.1007\/3-540-58601-6_92"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_52"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214016"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/263699.263719"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/113445.113447"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-006-8609-1"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926449"},{"key":"e_1_3_2_2_40_1","unstructured":"L.-N. Pouchet U. Bondhugula etal The polybench benchmarks. http:\/\/www.cse.ohio-state.edu\/ pouchet\/software\/polybench.  L.-N. Pouchet U. Bondhugula et al. The polybench benchmarks. http:\/\/www.cse.ohio-state.edu\/ pouchet\/software\/polybench."},{"key":"e_1_3_2_2_41_1","volume-title":"Technical report","author":"Pratt V. R.","year":"1977","unstructured":"V. R. Pratt . Two easy theories whose combination is hard. Technical report , Massachusetts Institute of Technology, Cambridge , Mass , 1977 . http:\/\/boole.stanford.edu\/pub\/sefnp.pdf. V. R. Pratt. Two easy theories whose combination is hard. Technical report, Massachusetts Institute of Technology, Cambridge, Mass, 1977. http:\/\/boole.stanford.edu\/pub\/sefnp.pdf."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/135226.135233"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2012.176.1.7"},{"key":"e_1_3_2_2_44_1","volume-title":"Theory of linear and integer programming","author":"Schrijver A.","year":"1986","unstructured":"A. Schrijver . Theory of linear and integer programming . John Wiley & Sons, Inc. , New York, NY, USA , 1986 . A. Schrijver. Theory of linear and integer programming. John Wiley & Sons, Inc., New York, NY, USA, 1986."},{"key":"e_1_3_2_2_45_1","volume-title":"On solving boolean combinations of UTVPI constraints. Journal on Satisfiability, Boolean Modeling and Computation (JSAT), 3(1--2):67--90","author":"Seshia S. A.","year":"2007","unstructured":"S. A. Seshia , K. Subramani , and R. E. Bryant . On solving boolean combinations of UTVPI constraints. Journal on Satisfiability, Boolean Modeling and Computation (JSAT), 3(1--2):67--90 , 2007 . S. A. Seshia, K. Subramani, and R. E. Bryant. On solving boolean combinations of UTVPI constraints. Journal on Satisfiability, Boolean Modeling and Computation (JSAT), 3(1--2):67--90, 2007."},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/322276.322288"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-010-9062-8"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/990308.990310"},{"key":"e_1_3_2_2_49_1","volume-title":"of California Press","author":"Tarski A.","year":"1951","unstructured":"A. Tarski . A decision method for elementary algebra and geometry. Univ . of California Press , Berkeley , 2 nd edition, 1951 . A. Tarski. A decision method for elementary algebra and geometry. Univ. of California Press, Berkeley, 2nd edition, 1951.","edition":"2"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/s101070100261"},{"key":"e_1_3_2_2_51_1","volume-title":"GCC Research Opportunities Workshop (GROW'10)","author":"Trifunovic K.","year":"2010","unstructured":"K. Trifunovic , A. Cohen , D. Edelsohn , F. Li , T. Grosser , H. Jagasia , R. Ladelsky , S. Pop , J. Sj\u00f6din , and R. Upadrasta . Graphite two years after: First lessons learned from real-world polyhedral compilation . In GCC Research Opportunities Workshop (GROW'10) , Pisa, Italy , Jan. 2010 . K. Trifunovic, A. Cohen, D. Edelsohn, F. Li, T. Grosser, H. Jagasia, R. Ladelsky, S. Pop, J. Sj\u00f6din, and R. Upadrasta. Graphite two years after: First lessons learned from real-world polyhedral compilation. In GCC Research Opportunities Workshop (GROW'10), Pisa, Italy, Jan. 2010."},{"key":"e_1_3_2_2_53_1","volume-title":"Potential and Challenges of Two-Variable-Per-Inequality Sub-Polyhedral Compilation. In First International Workshop on Polyhedral Compilation Techniques (IMPACT'11)","author":"Upadrasta R.","year":"2011","unstructured":"R. Upadrasta and A. Cohen . Potential and Challenges of Two-Variable-Per-Inequality Sub-Polyhedral Compilation. In First International Workshop on Polyhedral Compilation Techniques (IMPACT'11) , in conjunction with CGO'11, Chamonix, France , Apr. 2011 . R. Upadrasta and A. Cohen. Potential and Challenges of Two-Variable-Per-Inequality Sub-Polyhedral Compilation. In First International Workshop on Polyhedral Compilation Techniques (IMPACT'11), in conjunction with CGO'11, Chamonix, France, Apr. 2011."},{"key":"e_1_3_2_2_54_1","volume-title":"Second International Workshop on Polyhedral Compilation Techniques (IMPACT'12)","author":"Upadrasta R.","year":"2012","unstructured":"R. Upadrasta and A. Cohen . A Case for Strongly Polynomial Time Sub-Polyhedral Scheduling Using Two-Variable-Per-Inequality Polyhedra . In Second International Workshop on Polyhedral Compilation Techniques (IMPACT'12) , in conjunction with HiPEAC'12, Paris, France , Jan. 2012 . R. Upadrasta and A. Cohen. A Case for Strongly Polynomial Time Sub-Polyhedral Scheduling Using Two-Variable-Per-Inequality Polyhedra. In Second International Workshop on Polyhedral Compilation Techniques (IMPACT'12), in conjunction with HiPEAC'12, Paris, France, Jan. 2012."},{"key":"e_1_3_2_2_55_1","unstructured":"N. Vasilache. Scalable Program Optimization Techniques In The Polyhedral Model. PhD thesis Paris-Sud 11 University Sept. 2007.  N. Vasilache. Scalable Program Optimization Techniques In The Polyhedral Model. PhD thesis Paris-Sud 11 University Sept. 2007."},{"key":"e_1_3_2_2_56_1","volume-title":"Concurrency and Computation: Practice and Experience, 15(11--12):1047--1068","author":"Vivien F.","year":"2003","unstructured":"F. Vivien . On the optimality of feautrier's scheduling algorithm. Concurrency and Computation: Practice and Experience, 15(11--12):1047--1068 , 2003 . F. Vivien. On the optimality of feautrier's scheduling algorithm. Concurrency and Computation: Practice and Experience, 15(11--12):1047--1068, 2003."},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2004.01.009"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301261"},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.97902"},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"crossref","unstructured":"Y.-Q.\n      Yang C.\n      Ancourt and \n      F.\n      Irigoin\n  . \n  Minimal data dependence abstractions for loop transformations\n  . In K. Pingali U. Banerjee D. Gelernter A. Nicolau and D. A. Padua editors LCPC volume \n  892\n   of \n  Lecture Notes in Computer Science pages \n  201\n  --\n  216\n  . \n  Springer 1994\n  .   Y.-Q. Yang C. Ancourt and F. Irigoin. Minimal data dependence abstractions for loop transformations. In K. Pingali U. Banerjee D. Gelernter A. Nicolau and D. A. Padua editors LCPC volume 892 of Lecture Notes in Computer Science pages 201--216. Springer 1994.","DOI":"10.1007\/BFb0025880"},{"key":"e_1_3_2_2_61_1","volume-title":"Graduate texts in mathematics","author":"Ziegler G.","year":"2006","unstructured":"G. Ziegler . Lectures on polytopes. Graduate texts in mathematics . Springer Science , 2006 . G. Ziegler. Lectures on polytopes. Graduate texts in mathematics. Springer Science, 2006."}],"event":{"name":"POPL '13: The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Rome Italy","acronym":"POPL '13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2429069.2429127","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2429069.2429127","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:35:35Z","timestamp":1750221335000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2429069.2429127"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,23]]},"references-count":60,"alternative-id":["10.1145\/2429069.2429127","10.1145\/2429069"],"URL":"https:\/\/doi.org\/10.1145\/2429069.2429127","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2480359.2429127","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,1,23]]},"assertion":[{"value":"2013-01-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}