{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:26:44Z","timestamp":1750307204501,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,1,23]],"date-time":"2012-01-23T00:00:00Z","timestamp":1327276800000},"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":[[2012,1,23]]},"DOI":"10.1145\/2103746.2103752","type":"proceedings-article","created":{"date-parts":[[2012,1,24]],"date-time":"2012-01-24T16:47:19Z","timestamp":1327423639000},"page":"5-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Polynomial-time inverse computation for accumulative functions with multiple data traversals"],"prefix":"10.1145","author":[{"given":"Kazutaka","family":"Matsuda","sequence":"first","affiliation":[{"name":"Tohoku University, Sendai, Japan"}]},{"given":"Kazuhiro","family":"Inaba","sequence":"additional","affiliation":[{"name":"National Institute of Informatics , Tokyo, Japan"}]},{"given":"Keisuke","family":"Nakano","sequence":"additional","affiliation":[{"name":"The University of Electro-Communications, Tokyo, Japan"}]}],"member":"320","published-online":{"date-parts":[[2012,1,23]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"269","volume-title":"T. \u00c6","author":"Abramov S. M.","year":"2002","unstructured":"S. M. Abramov and R. Gl\u00fcck . Principles of inverse computation and the universal resolving algorithm . In T. \u00c6 . Mogensen, D. A. Schmidt, and I. H. Sudborough, editors, The Essence of Computation, LNCS 2566, pages 269 -- 295 . Springer , 2002 . S. M. Abramov and R. Gl\u00fcck. Principles of inverse computation and the universal resolving algorithm. In T. \u00c6. Mogensen, D. A. Schmidt, and I. H. Sudborough, editors, The Essence of Computation, LNCS 2566, pages 269--295. Springer, 2002."},{"key":"e_1_3_2_1_2_1","volume-title":"The theory of parsing, translation, and compiling","author":"Aho A. V.","year":"1972","unstructured":"A. V. Aho and J. D. Ullman . The theory of parsing, translation, and compiling . Prentice-Hall, Inc. , Upper Saddle River, NJ, USA, 1972 . A. V. Aho and J. D. Ullman. The theory of parsing, translation, and compiling. Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1972."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/347476.347484"},{"key":"e_1_3_2_1_4_1","volume-title":"Introduction to Functional Programming using Haskell","author":"Bird R.","year":"1998","unstructured":"R. Bird . Introduction to Functional Programming using Haskell . Prentice Hall , second edition edition, 1998 . R. Bird. Introduction to Functional Programming using Haskell. Prentice Hall, second edition edition, 1998."},{"key":"e_1_3_2_1_5_1","first-page":"1","article-title":"Redundant call elimination via tupling","volume":"69","author":"Chin W.-N.","year":"2006","unstructured":"W.-N. Chin , S.-C. Khoo , and N. Jones . Redundant call elimination via tupling . Fundam. Inform. , 69 ( 1 -- 2 ): 1--37, 2006 . W.-N. Chin, S.-C. Khoo, and N. Jones. Redundant call elimination via tupling. Fundam. Inform., 69 (1--2): 1--37, 2006.","journal-title":"Fundam. Inform."},{"key":"e_1_3_2_1_6_1","first-page":"322","volume-title":"EasyCheck -- test data for free","author":"Christiansen J.","year":"2008","unstructured":"J. Christiansen and S. Fischer . EasyCheck -- test data for free . In J. Garrigue and M. V. Hermenegildo, editors, FLOPS, LNCS 4989, pages 322 -- 336 . Springer , 2008 . J. Christiansen and S. Fischer. EasyCheck -- test data for free. In J. Garrigue and M. V. Hermenegildo, editors, FLOPS, LNCS 4989, pages 322--336. Springer, 2008."},{"key":"e_1_3_2_1_7_1","volume-title":"Tree automata techniques and applications. Available on: http:\/\/www.grappa.univ-lille3.fr\/tata","author":"Comon H.","year":"2007","unstructured":"H. Comon , M. Dauchet , R. Gilleron , C. L\u00f6ding , F. Jacquemard , D. Lugiez , S. Tison , and M. Tommasi . Tree automata techniques and applications. Available on: http:\/\/www.grappa.univ-lille3.fr\/tata , 2007 . H. Comon, M. Dauchet, R. Gilleron, C. L\u00f6ding, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http:\/\/www.grappa.univ-lille3.fr\/tata, 2007."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1999.2807"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701394511"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-003-0120-0"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90066-2"},{"key":"e_1_3_2_1_12_1","first-page":"219","volume-title":"IJCAI","author":"Eppstein D.","year":"1985","unstructured":"D. Eppstein . A heuristic approach to program inversion . In IJCAI , pages 219 -- 221 , 1985 . D. Eppstein. A heuristic approach to program inversion. In IJCAI, pages 219--221, 1985."},{"key":"e_1_3_2_1_13_1","first-page":"246","volume-title":"Towards practical typechecking for macro tree transducers","author":"Frisch A.","year":"2007","unstructured":"A. Frisch and H. Hosoya . Towards practical typechecking for macro tree transducers . In M. Arenas and M. I. Schwartzbach, editors, DBPL, LNCS 4797, pages 246 -- 260 . Springer , 2007 . Full version is available as Research Report, RR-6107, INRIA, 2007. A. Frisch and H. Hosoya. Towards practical typechecking for macro tree transducers. In M. Arenas and M. I. Schwartzbach, editors, DBPL, LNCS 4797, pages 246--260. Springer, 2007. Full version is available as Research Report, RR-6107, INRIA, 2007."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90241-0"},{"key":"e_1_3_2_1_15_1","first-page":"291","volume-title":"Derivation of deterministic inverse programs based on lr parsing","author":"Gl\u00fcck R.","year":"2004","unstructured":"R. Gl\u00fcck and M. Kawabe . Derivation of deterministic inverse programs based on lr parsing . In Y. Kameyama and P. J. Stuckey, editors, FLOPS, LNCS 2998, pages 291 -- 306 . Springer , 2004 . R. Gl\u00fcck and M. Kawabe. Derivation of deterministic inverse programs based on lr parsing. In Y. Kameyama and P. J. Stuckey, editors, FLOPS, LNCS 2998, pages 291--306. Springer, 2004."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1071221.1071222"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-5983-1","volume-title":"The Science of Programming","author":"Gries D.","year":"1981","unstructured":"D. Gries . The Science of Programming , chapter 21 Inverting Programs. Springer , Heidelberg , 1981 . D. Gries. The Science of Programming, chapter 21 Inverting Programs. Springer, Heidelberg, 1981."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/258948.258964"},{"key":"e_1_3_2_1_19_1","first-page":"1007","volume-title":"IJCAI","author":"Korf R. E.","year":"1981","unstructured":"R. E. Korf . Inversion of applicative programs. In P. J. Hayes, editor , IJCAI , pages 1007 -- 1009 . William Kaufmann , 1981 . R. E. Korf. Inversion of applicative programs. In P. J. Hayes, editor, IJCAI, pages 1007--1009. William Kaufmann, 1981."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065203"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11965893_18"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.10.035"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480945.1480955"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11957-6_24"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(02)00030-2"},{"key":"e_1_3_2_1_26_1","first-page":"322","volume-title":"Report on an implementation of a semi-inverter. In \\citetDBLP:conf\/ershov\/2006","author":"Mogensen T.","unstructured":"T. \u00c6. Mogensen . Report on an implementation of a semi-inverter. In \\citetDBLP:conf\/ershov\/2006 , pages 322 -- 334 . T. \u00c6. Mogensen. Report on an implementation of a semi-inverter. In \\citetDBLP:conf\/ershov\/2006, pages 322--334."},{"key":"e_1_3_2_1_27_1","unstructured":"N.\n      Nishida\n     and \n      G.\n      Vidal\n  . \n  Program inversion for tail recursive functions\n  . In M. Schmidt-Schau\u00df editor RTA volume \n  10\n   of \n  LIPIcs pages \n  283\n  --\n  298\n  . Schloss Dagstuhl - Leibniz-Zentrum fuer \n  Informatik 2011\n  .  N. Nishida and G. Vidal. Program inversion for tail recursive functions. In M. Schmidt-Schau\u00df editor RTA volume 10 of LIPIcs pages 283--298. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2011."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1973.5"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411286.1411292"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1760700"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796803004933"},{"key":"e_1_3_2_1_32_1","volume-title":"LNCS 302","author":"Yellin D. M.","year":"1988","unstructured":"D. M. Yellin . Attribute Grammar Inversion and Source-to-source Translation , LNCS 302 . Springer , 1988 . D. M. Yellin. Attribute Grammar Inversion and Source-to-source Translation, LNCS 302. Springer, 1988."}],"event":{"name":"POPL '12: The 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Philadelphia Pennsylvania USA","acronym":"POPL '12"},"container-title":["Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2103746.2103752","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2103746.2103752","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:22Z","timestamp":1750241182000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2103746.2103752"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,23]]},"references-count":32,"alternative-id":["10.1145\/2103746.2103752","10.1145\/2103746"],"URL":"https:\/\/doi.org\/10.1145\/2103746.2103752","relation":{},"subject":[],"published":{"date-parts":[[2012,1,23]]},"assertion":[{"value":"2012-01-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}