{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:17:23Z","timestamp":1762460243849},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642381966"},{"type":"electronic","value":"9783642381973"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38197-3_11","type":"book-chapter","created":{"date-parts":[[2013,4,17]],"date-time":"2013-04-17T03:53:41Z","timestamp":1366170821000},"page":"155-175","source":"Crossref","is-referenced-by-count":0,"title":["Improving Determinization of Grammar Programs for Program Inversion"],"prefix":"10.1007","author":[{"given":"Minami","family":"Niwa","sequence":"first","affiliation":[]},{"given":"Naoki","family":"Nishida","sequence":"additional","affiliation":[]},{"given":"Masahiko","family":"Sakai","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Abramov, S.M., Gl\u00fcck, R.: Principles of inverse computation in a functional language. In: APLAS 2000, pp. 141\u2013152 (2000)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/10722010_13","volume-title":"Mathematics of Program Construction","author":"S. Abramov","year":"2000","unstructured":"Abramov, S., Gl\u00fcck, R.: The universal resolving algorithm: Inverse computation in a functional language. In: Backhouse, R., Oliveira, J.N. (eds.) MPC 2000. LNCS, vol.\u00a01837, pp. 187\u2013212. Springer, Heidelberg (2000)"},{"issue":"2-3","key":"11_CR3","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0167-6423(02)00023-0","volume":"43","author":"S.M. Abramov","year":"2002","unstructured":"Abramov, S.M., Gl\u00fcck, R.: The universal resolving algorithm and its correctness: inverse computation in a functional language. Sci. Comput. Program.\u00a043(2-3), 193\u2013229 (2002)","journal-title":"Sci. Comput. Program."},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-74130-5_15","volume-title":"Implementation and Application of Functional Languages","author":"J.M. Almendros-Jim\u00e9nez","year":"2007","unstructured":"Almendros-Jim\u00e9nez, J.M., Vidal, G.: Automatic partial inversion of inductively sequential functions. In: Horv\u00e1th, Z., Zs\u00f3k, V., Butterfield, A. (eds.) IFL 2006. LNCS, vol.\u00a04449, pp. 253\u2013270. Springer, Heidelberg (2007)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"11_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/11814771_24","volume-title":"Automated Reasoning","author":"J. Giesl","year":"2006","unstructured":"Giesl, J., Schneider-Kamp, P., Thiemann, R.: AProVE 1.2: Automatic termination proofs in the dependency pair framework. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol.\u00a04130, pp. 281\u2013286. Springer, Heidelberg (2006)"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-40018-9_17","volume-title":"Programming Languages and Systems","author":"R. Gl\u00fcck","year":"2003","unstructured":"Gl\u00fcck, R., Kawabe, M.: A program inverter for a functional language with equality and constructors. In: Ohori, A. (ed.) APLAS 2003. LNCS, vol.\u00a02895, pp. 246\u2013264. Springer, Heidelberg (2003)"},{"issue":"4","key":"11_CR8","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":"11_CR9","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":"11_CR10","doi-asserted-by":"crossref","unstructured":"Gl\u00fcck, R., Kawada, Y., Hashimoto, T.: Transforming interpreters into inverse interpreters by partial evaluation. In: Proceedings of Partial Evaluation and Semantics-based Program Manipulation, pp. 10\u201319. ACM Press (2003)","DOI":"10.1145\/966049.777391"},{"key":"11_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5983-1","volume-title":"The Science of Programming","author":"D. Gries","year":"1981","unstructured":"Gries, D.: The Science of Programming. Springer, Heidelberg (1981)"},{"key":"11_CR12","unstructured":"Harrison, P.G.: Function inversion. In: Proceedings of the IFIP TC2 Workshop on Partial Evaluation and Mixed Computation, pp. 153\u2013166. North-Holland (1988)"},{"issue":"3","key":"11_CR13","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF01185679","volume":"29","author":"P.G. Harrison","year":"1992","unstructured":"Harrison, P.G., Khoshnevisan, H.: On the synthesis of function inverses. Acta Inf.\u00a029(3), 211\u2013239 (1992)","journal-title":"Acta Inf."},{"key":"11_CR14","series-title":"LNCS","first-page":"318","volume-title":"CADE 1980","author":"J.M. Hullot","year":"1980","unstructured":"Hullot, J.M.: Canonical forms and unification. In: Bibel, W., Kowalski, R. (eds.) CADE 1980. LNCS, vol.\u00a087, pp. 318\u2013334. Springer, Heidelberg (1980)"},{"key":"11_CR15","unstructured":"Kawabe, M., Futamura, Y.: Case studies with an automatic program inversion system. In: Proceedings of the 21st Conference of Japan Society for Software Science and Technology, 6C-3, pp. 1\u20135 (2004)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-540-30557-6_17","volume-title":"Practical Aspects of Declarative Languages","author":"M. Kawabe","year":"2005","unstructured":"Kawabe, M., Gl\u00fcck, R.: The program inverter LRinv and its structure. In: Hermenegildo, M.V., Cabeza, D. (eds.) PADL 2005. LNCS, vol.\u00a03350, pp. 219\u2013234. Springer, Heidelberg (2005)"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1007\/3-540-51081-8_139","volume-title":"Rewriting Techniques and Applications","author":"H. Khoshnevisan","year":"1989","unstructured":"Khoshnevisan, H., Sephton, K.M.: InvX: An automatic function inverter. In: Dershowitz, N. (ed.) RTA 1989. LNCS, vol.\u00a0355, pp. 564\u2013568. Springer, Heidelberg (1989)"},{"key":"11_CR18","unstructured":"Korf, R.E.: Inversion of applicative programs. In: Proceedings of the 7th International Joint Conference on Artificial Intelligence, pp. 1007\u20131009. William Kaufmann (1981)"},{"issue":"4","key":"11_CR19","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1016\/j.ipl.2005.05.002","volume":"95","author":"S. Lucas","year":"2005","unstructured":"Lucas, S., March\u00e9, C., Meseguer, J.: Operational termination of conditional term rewriting systems. Inf. Process. Lett.\u00a095(4), 446\u2013453 (2005)","journal-title":"Inf. Process. Lett."},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-642-11957-6_24","volume-title":"Programming Languages and Systems","author":"K. Matsuda","year":"2010","unstructured":"Matsuda, K., Mu, S.-C., Hu, Z., Takeichi, M.: A grammar-based approach to invertible programs. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol.\u00a06012, pp. 448\u2013467. Springer, Heidelberg (2010)"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"McCarthy, J.: The inversion of functions defined by Turing machines. In: Automata Studies, pp. 177\u2013181. Princeton University Press (1956)","DOI":"10.1515\/9781400882618-009"},{"key":"11_CR22","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.tcs.2012.09.005","volume":"464","author":"M. Nagashima","year":"2012","unstructured":"Nagashima, M., Sakai, M., Sakabe, T.: Determinization of conditional term rewriting systems. Theor. Comput. Sci.\u00a0464, 72\u201389 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Nishida, N., Sakai, M.: Completion after program inversion of injective functions. In: Proceedings of the 8th International Workshop on Reduction Strategies in Rewriting and Programming. ENTCS, vol.\u00a0237, pp. 39\u201356 (2009)","DOI":"10.1016\/j.entcs.2009.03.034"},{"issue":"8","key":"11_CR24","first-page":"1171","volume":"J88-D-I","author":"N. Nishida","year":"2005","unstructured":"Nishida, N., Sakai, M., Sakabe, T.: Generation of inverse computation programs of constructor term rewriting systems. The IEICE Trans. Inf. & Syst.\u00a0J88-D-I(8), 1171\u20131183 (2005) (in Japanese)","journal-title":"The IEICE Trans. Inf. & Syst."},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"3","key":"11_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2168\/LMCS-8(3:4)2012","volume":"8","author":"N. Nishida","year":"2012","unstructured":"Nishida, N., Sakai, M., Sakabe, T.: Soundness of unravelings for conditional term rewriting systems via ultra-properties related to linearity. Logical Methods in Computer Science\u00a08(3), 1\u201349 (2012)","journal-title":"Logical Methods in Computer Science"},{"key":"11_CR27","unstructured":"Nishida, N., Vidal, G.: Program inversion for tail recursive functions. In: Schmidt-Schau\u00df, M. (ed.) RTA 2011. LIPIcs, vol.\u00a010, pp. 283\u2013298. Schlo\u00df Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2011)"},{"key":"11_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/978-3-642-38197-3_10","volume-title":"LOPSTR 2012","author":"N. Nishida","year":"2013","unstructured":"Nishida, N., Vidal, G.: Computing more specific versions of conditional rewriting systems. In: Albert, E. (ed.) LOPSTR 2012. LNCS, vol.\u00a07844, pp. 137\u2013154. Springer, Heidelberg (2013)"},{"key":"11_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3661-8","volume-title":"Advanced topics in term rewriting","author":"E. Ohlebusch","year":"2002","unstructured":"Ohlebusch, E.: Advanced topics in term rewriting. Springer, Heidelberg (2002)"},{"key":"11_CR30","unstructured":"Romanenko, A.: The generation of inverse functions in Refal. In: Proceedings of the IFIP TC2 Workshop on Partial Evaluation and Mixed Computation, pp. 427\u2013444. North-Holland (1988)"},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"Romanenko, A.: Inversion and metacomputation. In: Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pp. 12\u201322. ACM Press (1991)","DOI":"10.1145\/115865.115868"},{"key":"11_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-642-02348-4_20","volume-title":"Rewriting Techniques and Applications","author":"F. Schernhammer","year":"2009","unstructured":"Schernhammer, F., Gramlich, B.: VMTL\u2013A modular termination laboratory. In: Treinen, R. (ed.) RTA 2009. LNCS, vol.\u00a05595, pp. 285\u2013294. Springer, Heidelberg (2009)"},{"issue":"1","key":"11_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1614431.1614433","volume":"11","author":"P. Schneider-Kamp","year":"2009","unstructured":"Schneider-Kamp, P., Giesl, J., Serebrenik, A., Thiemann, R.: Automated termination proofs for logic programs by term rewriting. ACM Trans. on Comput. Log.\u00a011(1), 1\u201352 (2009)","journal-title":"ACM Trans. on Comput. Log."},{"key":"11_CR34","doi-asserted-by":"crossref","unstructured":"Secher, J.P., S\u00f8rensen, M.H.: From checking to inference via driving and dag grammars. In: Proceedings of Partial Evaluation and Semantics-Based Program Manipulation, pp. 41\u201351. ACM Press (2002)","DOI":"10.1145\/509799.503036"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38197-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T07:45:56Z","timestamp":1557647156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38197-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642381966","9783642381973"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38197-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}