{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:53:16Z","timestamp":1762458796745},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642119569"},{"type":"electronic","value":"9783642119576"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11957-6_24","type":"book-chapter","created":{"date-parts":[[2010,3,8]],"date-time":"2010-03-08T00:55:38Z","timestamp":1268009738000},"page":"448-467","source":"Crossref","is-referenced-by-count":14,"title":["A Grammar-Based Approach to Invertible Programs"],"prefix":"10.1007","author":[{"given":"Kazutaka","family":"Matsuda","sequence":"first","affiliation":[]},{"given":"Shin-Cheng","family":"Mu","sequence":"additional","affiliation":[]},{"given":"Zhenjiang","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Masato","family":"Takeichi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Abramov, S.M., Gl\u00fcck, R.: Principles of Inverse Computation and the Universal Resolving Algorithm. In: The Essence of Computation, pp. 269\u2013295 (2002)","DOI":"10.1007\/3-540-36377-7_13"},{"key":"24_CR2","volume-title":"The Theory of Parsing, Translation, and Compiling","author":"A.V. Aho","year":"1972","unstructured":"Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation, and Compiling. Prentice-Hall, Inc., Upper Saddle River (1972)"},{"issue":"1","key":"24_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1080\/00207168108803261","volume":"10","author":"P.R.J. Asveld","year":"1981","unstructured":"Asveld, P.R.J.: Time and Space Complexity of Inside-Out Macro Languages. Int. J. Comput. Math.\u00a010(1), 3\u201314 (1981)","journal-title":"Int. J. Comput. Math."},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/3-540-63174-7_2","volume-title":"Automata Implementation","author":"M. Biehl","year":"1997","unstructured":"Biehl, M., Klarlund, N., Rauhe, T.: Algorithms for Guided Tree Automata. In: Raymond, D.R., Yu, S., Wood, D. (eds.) WIA 1996. LNCS, vol.\u00a01260, pp. 6\u201325. Springer, Heidelberg (1997)"},{"key":"24_CR5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/1-4020-2295-6_13","volume-title":"New Developments in Parsing Technology","author":"P. Boullier","year":"2004","unstructured":"Boullier, P.: Range Concatenation Grammars. In: New Developments in Parsing Technology, pp. 269\u2013289. Kluwer Academic Publishers, Norwell (2004)"},{"key":"24_CR6","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications, \n                  \n                    http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/3-540-48685-2_2","volume-title":"Rewriting Techniques and Applications","author":"N. Dershowitz","year":"1999","unstructured":"Dershowitz, N., Mitra, S.: Jeopardy. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol.\u00a01631, pp. 16\u201329. Springer, Heidelberg (1999)"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/BFb0014657","volume-title":"Program Construction","author":"E.W. Dijkstra","year":"1979","unstructured":"Dijkstra, E.W.: Program Inversion. In: Gerhart, S.L., Pair, C., Pepper, P.A., W\u00f6ssner, H., Dijkstra, E.W., Guttag, J.V., Owicki, S.S., Partsch, H., Bauer, F.L., Gries, D., Griffiths, M., Horning, J.J., Wirsing, M. (eds.) Program Construction. LNCS, vol.\u00a069, pp. 54\u201357. Springer, Heidelberg (1979)"},{"issue":"3","key":"24_CR9","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/S0022-0000(77)80034-2","volume":"15","author":"J. Engelfriet","year":"1977","unstructured":"Engelfriet, J., Schmidt, E.M.: IO and OI. I. J. Comput. Syst. Sci.\u00a015(3), 328\u2013353 (1977)","journal-title":"I. J. Comput. Syst. Sci."},{"issue":"1","key":"24_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0022-0000(85)90066-2","volume":"31","author":"J. Engelfriet","year":"1985","unstructured":"Engelfriet, J., Vogler, H.: Macro Tree Transducers. J. Comput. Syst. Sci.\u00a031(1), 71\u2013146 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"24_CR11","unstructured":"Eppstein, D.: A Heuristic Approach to Program Inversion. In: International Joint Conference on Artificial Intelligence (IJCAI 1985), pp. 219\u2013221 (1985)"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Foster, J.N., Greenwald, M.B., Moore, J.T., Pierce, B.C., Schmitt, A.: Combinators for Bidirectional Tree Transformations: A Linguistic Approach to the View-Update Problem. ACM Trans. Program. Lang. Syst.\u00a029(3) (2007)","DOI":"10.1145\/1232420.1232424"},{"key":"24_CR13","first-page":"661","volume-title":"Exploring New Frontiers of Theoretical Informatics, IFIP 18th World Computer Congress, TC1 3rd International Conference on Theoretical Computer Science (TCS 2004)","author":"A. Frisch","year":"2004","unstructured":"Frisch, A.: Regular Tree Language Recognition with Static Information. In: L\u00e9vy, J.J., Mayr, E.W., Mitchell, J.C. (eds.) Exploring New Frontiers of Theoretical Informatics, IFIP 18th World Computer Congress, TC1 3rd International Conference on Theoretical Computer Science (TCS 2004), pp. 661\u2013674. Kluwer, Dordrecht (2004)"},{"key":"24_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-72248-6","volume-title":"Syntax-Directed Semantics: Formal Models Based on Tree Transducers","author":"Z. F\u00fcl\u00f6p","year":"1998","unstructured":"F\u00fcl\u00f6p, Z., Vogler, H.: Syntax-Directed Semantics: Formal Models Based on Tree Transducers. Springer, New York (1998)"},{"issue":"4","key":"24_CR15","first-page":"367","volume":"66","author":"R. Gl\u00fcck","year":"2005","unstructured":"Gl\u00fcck, R., Kawabe, M.: A Method for Automatic Program Inversion Based on LR(0) Parsing. Fundam. Inform.\u00a066(4), 367\u2013395 (2005)","journal-title":"Fundam. Inform."},{"issue":"5","key":"24_CR16","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/1071221.1071222","volume":"40","author":"R. Gl\u00fcck","year":"2005","unstructured":"Gl\u00fcck, R., Kawabe, M.: Revisiting an Automatic Program Inverter for Lisp. SIGPLAN Notices\u00a040(5), 8\u201317 (2005)","journal-title":"SIGPLAN Notices"},{"key":"24_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-5983-1","volume-title":"The Science of Programming","author":"D. Gries","year":"1981","unstructured":"Gries, D.: 21 Inverting Programs. In: The Science of Programming. Springer, Heidelberg (1981)"},{"key":"24_CR18","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"2006","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: 7 Properties of Context-Free Languages. In: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Addison-Wesley Longman Publishing Co., Inc., Amsterdam (2006)","edition":"3"},{"issue":"2","key":"24_CR19","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/767193.767195","volume":"3","author":"H. Hosoya","year":"2003","unstructured":"Hosoya, H., Pierce, B.C.: XDuce: A Statically Typed XML Processing Language. ACM Trans. Internet Techn.\u00a03(2), 117\u2013148 (2003)","journal-title":"ACM Trans. Internet Techn."},{"key":"24_CR20","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1145\/258948.258964","volume-title":"ICFP 1997: Proceedings of the second ACM SIGPLAN International Conference on Functional Programming","author":"Z. Hu","year":"1997","unstructured":"Hu, Z., Iwasaki, H., Takeichi, M., Takano, A.: Tupling Calculation Eliminates Multiple Data Traversals. In: ICFP 1997: Proceedings of the second ACM SIGPLAN International Conference on Functional Programming, pp. 164\u2013175. ACM Press, New York (1997)"},{"key":"24_CR21","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/1291151.1291162","volume-title":"ICFP 2007: Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming","author":"K. Matsuda","year":"2007","unstructured":"Matsuda, K., Hu, Z., Nakano, K., Hamana, M., Takeichi, M.: Bidirectionalization Transformation based on Automatic Derivation of View Complement Functions. In: ICFP 2007: Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming, pp. 47\u201358. ACM, New York (2007)"},{"key":"24_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/11783596_22","volume-title":"Mathematics of Program Construction","author":"A. Morihata","year":"2006","unstructured":"Morihata, A., Kakehi, K., Hu, Z., Takeichi, M.: Swapping Arguments and Results of Recursive Functions. In: Uustalu, T. (ed.) MPC 2006. LNCS, vol.\u00a04014, pp. 379\u2013396. Springer, Heidelberg (2006)"},{"key":"24_CR23","series-title":"Lecture Notes in Computer Science","first-page":"289","volume-title":"Mathematics of Program Construction","author":"S.C. Mu","year":"2004","unstructured":"Mu, S.C., Hu, Z., Takeichi, M.: An Injective Language for Reversible Computation. In: Kozen, D. (ed.) MPC 2004. LNCS, vol.\u00a03125, pp. 289\u2013313. Springer, Heidelberg (2004)"},{"key":"24_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/978-3-540-49382-2_12","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"A. Neumann","year":"1998","unstructured":"Neumann, A., Seidl, H.: Locating Matches of Tree Patterns in Forests. In: Arvind, V., Sarukkai, S. (eds.) FST TCS 1998. LNCS, vol.\u00a01530, pp. 134\u2013146. Springer, Heidelberg (1998)"},{"key":"24_CR25","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.entcs.2009.03.034","volume":"237","author":"N. Nishida","year":"2009","unstructured":"Nishida, N., Sakai, M.: Completion after Program Inversion of Injective Functions. Electr. Notes Theor. Comput. Sci.\u00a0237, 39\u201356 (2009)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"24_CR26","series-title":"Lecture Notes in Computer Science","volume-title":"Accepted for FLOPS 2010","author":"N. Nishida","year":"2010","unstructured":"Nishida, N., Sakai, M.: Proving Injectivity of Functions via Program Inversion in Term Rewriting. Accepted for FLOPS 2010. LNCS, vol.\u00a06009. Springer, Heidelberg (2010)"},{"key":"24_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1007\/978-3-540-32033-3_20","volume-title":"Term Rewriting and Applications","author":"N. Nishida","year":"2005","unstructured":"Nishida, N., Sakai, M., Sakabe, T.: Partial Inversion of Constructor Term Rewriting Systems. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 264\u2013278. Springer, Heidelberg (2005)"},{"issue":"1","key":"24_CR28","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0022-0000(85)90002-9","volume":"30","author":"K.M. Schimpf","year":"1985","unstructured":"Schimpf, K.M., Gallier, J.H.: Tree Pushdown Automata. J. Comput. Syst. Sci.\u00a030(1), 25\u201340 (1985)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"24_CR29","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0304-3975(90)90147-A","volume":"73","author":"P. Wadler","year":"1990","unstructured":"Wadler, P.: Deforestation: Transforming Programs to Eliminate Trees. Theor. Comput. Sci.\u00a073(2), 231\u2013248 (1990)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-19072-4","volume-title":"Attribute Grammar Inversion and Source-to-source Translation","author":"D.M. Yellin","year":"1988","unstructured":"Yellin, D.M.: Attribute Grammar Inversion and Source-to-source Translation. LNCS, vol.\u00a0302. Springer, Heidelberg (1988)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11957-6_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:32:38Z","timestamp":1558287158000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11957-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642119569","9783642119576"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11957-6_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}