{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:46Z","timestamp":1772164006383,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,1,17]],"date-time":"2010-01-17T00:00:00Z","timestamp":1263686400000},"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":[[2010,1,17]]},"DOI":"10.1145\/1706299.1706311","type":"proceedings-article","created":{"date-parts":[[2010,1,19]],"date-time":"2010-01-19T15:15:04Z","timestamp":1263914104000},"page":"83-92","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["A simple, verified validator for software pipelining"],"prefix":"10.1145","author":[{"given":"Jean-Baptiste","family":"Tristan","sequence":"first","affiliation":[{"name":"INRIA Paris-Rocquencourt, Le Chesnay, France"}]},{"given":"Xavier","family":"Leroy","sequence":"additional","affiliation":[{"name":"INRIA Paris-Rocquencourt, Le Chesnay, France"}]}],"member":"320","published-online":{"date-parts":[[2010,1,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Compilers: principles, techniques, and tools","author":"Aho A. V.","year":"2006","unstructured":"A. V. Aho , M. Lam , R. Sethi , and J. D. Ullman . Compilers: principles, techniques, and tools . Addison-Wesley , second edition, 2006 . A. V. Aho, M. Lam, R. Sethi, and J. D. Ullman. Compilers: principles, techniques, and tools. Addison-Wesley, second edition, 2006."},{"key":"e_1_3_2_1_2_1","volume-title":"Modern Compiler Implementation in ML","author":"Appel A. W.","year":"1998","unstructured":"A. W. Appel . Modern Compiler Implementation in ML . Cambridge University Press , 1998 . A. W. Appel. Modern Compiler Implementation in ML. Cambridge University Press, 1998."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11513988_29"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/514191.514208"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/645989.674330"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11823230_19"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/155090.155115"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SEFM.2006.4"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542513"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/53990.54022"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1538788.1538814"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-009-9155-4"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-008-9099-0"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/581630.581676"},{"key":"e_1_3_2_1_15_1","first-page":"80","volume-title":"IFIP WG10.3 Working Conference on Parallel Architectures and Compilation Techniques","author":"Llosa J.","year":"1996","unstructured":"J. Llosa , A. Gonz\u00e1lez , E. Ayguad\u00e9 , and M. Valero . Swing modulo scheduling: A lifetime-sensitive approach . In IFIP WG10.3 Working Conference on Parallel Architectures and Compilation Techniques , pages 80 -- 86 , 1996 . J. Llosa, A. Gonz\u00e1lez, E. Ayguad\u00e9, and M. Valero. Swing modulo scheduling: A lifetime-sensitive approach. In IFIP WG10.3 Working Conference on Parallel Architectures and Compilation Techniques, pages 80--86, 1996."},{"key":"e_1_3_2_1_16_1","volume-title":"Morgan Kaufmann","author":"Muchnick S. S.","year":"1997","unstructured":"S. S. Muchnick . Advanced compiler design and implementation . Morgan Kaufmann , 1997 . S. S. Muchnick. Advanced compiler design and implementation. Morgan Kaufmann, 1997."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2009.05.052"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/349299.349314"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s100090050027"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/646482.691453"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/125826.125848"},{"issue":"1","key":"e_1_3_2_1_22_1","first-page":"1","article-title":"Iterative modulo scheduling","volume":"24","author":"Rau B. R.","year":"1996","unstructured":"B. R. Rau . Iterative modulo scheduling . International Journal of Parallel Processing , 24 ( 1 ): 1 -- 102 , 1996 . B. R. Rau. Iterative modulo scheduling. International Journal of Parallel Processing, 24(1):1--102, 1996.","journal-title":"International Journal of Parallel Processing"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964002"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480915"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328444"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542512"},{"issue":"3","key":"e_1_3_2_1_28_1","first-page":"223","article-title":"VOC: A methodology for translation validation of optimizing compilers","volume":"9","author":"Zuck L.","year":"2003","unstructured":"L. Zuck , A. Pnueli , Y. Fang , and B. Goldberg . VOC: A methodology for translation validation of optimizing compilers . Journal of Universal Computer Science , 9 ( 3 ): 223 -- 247 , 2003 . L. Zuck, A. Pnueli, Y. Fang, and B. Goldberg. VOC: A methodology for translation validation of optimizing compilers. Journal of Universal Computer Science, 9(3):223--247, 2003.","journal-title":"Journal of Universal Computer Science"}],"event":{"name":"POPL '10: The 37th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Madrid Spain","acronym":"POPL '10","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1706299.1706311","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1706299.1706311","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:26:18Z","timestamp":1750263978000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1706299.1706311"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,17]]},"references-count":27,"alternative-id":["10.1145\/1706299.1706311","10.1145\/1706299"],"URL":"https:\/\/doi.org\/10.1145\/1706299.1706311","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1707801.1706311","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2010,1,17]]},"assertion":[{"value":"2010-01-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}