{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:45:35Z","timestamp":1772163935674,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,10]],"date-time":"2007-06-10T00:00:00Z","timestamp":1181433600000},"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":[[2007,6,10]]},"DOI":"10.1145\/1250734.1250752","type":"proceedings-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T12:07:37Z","timestamp":1189771657000},"page":"146-155","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":44,"title":["Automatic inversion generates divide-and-conquer parallel programs"],"prefix":"10.1145","author":[{"given":"Kazutaka","family":"Morita","sequence":"first","affiliation":[{"name":"University of Tokyo, Tokyo, Japan"}]},{"given":"Akimasa","family":"Morihata","sequence":"additional","affiliation":[{"name":"University of Tokyo, Tokyo, Japan"}]},{"given":"Kiminori","family":"Matsuzaki","sequence":"additional","affiliation":[{"name":"University of Tokyo, Tokyo, Japan"}]},{"given":"Zhenjiang","family":"Hu","sequence":"additional","affiliation":[{"name":"University of Tokyo, Tokyo, Japan"}]},{"given":"Masato","family":"Takeichi","sequence":"additional","affiliation":[{"name":"University of Tokyo, Tokyo, Japan"}]}],"member":"320","published-online":{"date-parts":[[2007,6,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1142\/S012962640000010X"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.899937"},{"key":"e_1_3_2_1_3_1","first-page":"69","volume-title":"Programming Pearls, rm Column 7","author":"Bentley J.","year":"1986","unstructured":"J. Bentley . Algorithm design techniques . In Programming Pearls, rm Column 7 , pages 69 -- 80 . Addison-Wesley , 1986 . J. Bentley. Algorithm design techniques. In Programming Pearls, rm Column 7, pages 69--80. Addison-Wesley, 1986."},{"key":"e_1_3_2_1_4_1","first-page":"5","volume-title":"NATO ASI Series F 36","author":"Bird R. S.","year":"1987","unstructured":"R. S. Bird . An introduction to the theory of lists. In Logic of Programming and Calculi of Discrete Design , NATO ASI Series F 36 , pages 5 -- 42 . 1987 . R. S. Bird. An introduction to the theory of lists. In Logic of Programming and Calculi of Discrete Design, NATO ASI Series F 36, pages 5--42. 1987."},{"key":"e_1_3_2_1_5_1","volume-title":"Introduction to Functional Programming using Haskell","author":"Bird R. S.","year":"1998","unstructured":"R. S. Bird . Introduction to Functional Programming using Haskell . Prentice Hall , 1998 . R. S. Bird. Introduction to Functional Programming using Haskell. Prentice Hall, 1998."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.42122"},{"key":"e_1_3_2_1_8_1","volume-title":"Algorithmic skeletons: A structured approach to the management of parallel computation. Research Monographs in Parallel and Distributed Computing","author":"Cole M.","year":"1989","unstructured":"M. Cole . Algorithmic skeletons: A structured approach to the management of parallel computation. Research Monographs in Parallel and Distributed Computing , 1989 . M. Cole. Algorithmic skeletons: A structured approach to the management of parallel computation. Research Monographs in Parallel and Distributed Computing, 1989."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626495000175"},{"key":"e_1_3_2_1_10_1","first-page":"91","article-title":"Theorem proving in arithmetic without multiplication","volume":"7","author":"Cooper D. C.","year":"1972","unstructured":"D. C. Cooper . Theorem proving in arithmetic without multiplication . Machine Intelligence , 7 : 91 -- 99 , 1972 . D. C. Cooper. Theorem proving in arithmetic without multiplication. Machine Intelligence, 7:91--99, 1972.","journal-title":"Machine Intelligence"},{"key":"e_1_3_2_1_11_1","first-page":"137","volume-title":"6th Symposium on Operating System Design and Implementation (OSDI 2004","author":"Dean J.","year":"2004","unstructured":"J. Dean and S. Ghemawat . MapReduce: Simplified data processing on large clusters . In 6th Symposium on Operating System Design and Implementation (OSDI 2004 ), pages 137 -- 150 , 2004 . J. Dean and S. Ghemawat. MapReduce: Simplified data processing on large clusters. In 6th Symposium on Operating System Design and Implementation (OSDI 2004), pages 137--150, 2004."},{"key":"e_1_3_2_1_12_1","first-page":"54","volume-title":"LNCS 69","author":"Dijkstra E. W.","year":"1978","unstructured":"E. W. Dijkstra . Program inversion. In Program Construction , LNCS 69 , pages 54 -- 57 . 1978 . E. W. Dijkstra. Program inversion. In Program Construction, LNCS 69, pages 54--57. 1978."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1625135.1625175"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/178243.178255"},{"key":"e_1_3_2_1_15_1","first-page":"46","volume-title":"Algebraic and Logic Programming (ALP'97), LNCS 1298","author":"Geser A.","year":"1997","unstructured":"A. Geser and S. Gorlatch . Parallelizing functional programs by generalization . In Algebraic and Logic Programming (ALP'97), LNCS 1298 , pages 46 -- 60 . 1997 . A. Geser and S. Gorlatch. Parallelizing functional programs by generalization. In Algebraic and Logic Programming (ALP'97), LNCS 1298, pages 46--60. 1997."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800001908"},{"key":"e_1_3_2_1_17_1","first-page":"246","volume-title":"Proceedings, LNCS 2895","author":"Gl\u00fcck R.","year":"2003","unstructured":"R. Gl\u00fcck and M. Kawabe . A program inverter for a functional language with equality and constructors. In Programming Languages and Systems . Proceedings, LNCS 2895 , pages 246 -- 264 . 2003 . R. Gl\u00fcck and M. Kawabe. A program inverter for a functional language with equality and constructors. In Programming Languages and Systems. Proceedings, LNCS 2895, pages 246--264. 2003."},{"key":"e_1_3_2_1_18_1","first-page":"291","volume-title":"7th International Symposium (FLOPS 2004), Proceedings, LNCS 2998","author":"Gl\u00fcck R.","year":"2004","unstructured":"R. Gl\u00fcck and M. Kawabe . Derivation of deterministic inverse programs based on LR parsing. In Functional and Logic Programming , 7th International Symposium (FLOPS 2004), Proceedings, LNCS 2998 , pages 291 -- 306 . 2004 . R. Gl\u00fcck and M. Kawabe. Derivation of deterministic inverse programs based on LR parsing. In Functional and Logic Programming, 7th International Symposium (FLOPS 2004), Proceedings, LNCS 2998, pages 291--306. 2004."},{"key":"e_1_3_2_1_19_1","first-page":"274","volume-title":"Logics and Programs. PLILP'96","author":"Gorlatch S.","year":"1996","unstructured":"S. Gorlatch . Systematic extraction and implementation of divide-and-conquer parallelism. In Programming languages: Implementation , Logics and Programs. PLILP'96 , LNCS 1140, pages 274 -- 288 . 1996 . S. Gorlatch. Systematic extraction and implementation of divide-and-conquer parallelism. In Programming languages: Implementation, Logics and Programs. PLILP'96, LNCS 1140, pages 274--288. 1996."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5983-1_22"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/256167.256201"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/268946.268972"},{"key":"e_1_3_2_1_23_1","first-page":"1007","volume-title":"Proceedings of the 7th International Conferences on Artificial Intelligence (IC--AI '81)","author":"Korf R. E.","year":"1981","unstructured":"R. E. Korf . Inversion of applicative programs . In Proceedings of the 7th International Conferences on Artificial Intelligence (IC--AI '81) , pages 1007 -- 1009 , 1981 . R. E. Korf. Inversion of applicative programs. In Proceedings of the 7th International Conferences on Artificial Intelligence (IC--AI '81), pages 1007--1009, 1981."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146847.1146860"},{"key":"e_1_3_2_1_25_1","unstructured":"M. Presburger. Uber die vollstandigkeit eines gewissen systems der arithmetik ganzer zahlen in welchem die addition als einzige operation hervorstritt. Sprawozdanie z I Kongresu Matematikow Krajow Slowcanskich Warszawa pages 92--101 1929.  M. Presburger. Uber die vollstandigkeit eines gewissen systems der arithmetik ganzer zahlen in welchem die addition als einzige operation hervorstritt. Sprawozdanie z I Kongresu Matematikow Krajow Slowcanskich Warszawa pages 92--101 1929."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/125826.125848"},{"key":"e_1_3_2_1_27_1","volume-title":"Patterns and Skeletons for Parallel and Distributed Computing","author":"Rabhi F.","year":"2002","unstructured":"F. Rabhi and S. Gorlatch . Patterns and Skeletons for Parallel and Distributed Computing . 2002 . F. Rabhi and S. Gorlatch. Patterns and Skeletons for Parallel and Distributed Computing. 2002."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/301104.301111"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/351240.351254"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/11737414_1"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30477-7_14"}],"event":{"name":"PLDI '07: ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"San Diego California USA","acronym":"PLDI '07","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250734.1250752","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1250734.1250752","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:19Z","timestamp":1750243939000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250734.1250752"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,10]]},"references-count":30,"alternative-id":["10.1145\/1250734.1250752","10.1145\/1250734"],"URL":"https:\/\/doi.org\/10.1145\/1250734.1250752","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1273442.1250752","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2007,6,10]]},"assertion":[{"value":"2007-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}