{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:55:23Z","timestamp":1762458923636,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642243639"},{"type":"electronic","value":"9783642243646"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24364-6_13","type":"book-chapter","created":{"date-parts":[[2011,9,29]],"date-time":"2011-09-29T01:22:21Z","timestamp":1317259341000},"page":"179-194","source":"Crossref","is-referenced-by-count":1,"title":["Controlled Term Rewriting"],"prefix":"10.1007","author":[{"given":"Florent","family":"Jacquemard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshiharu","family":"Kojima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masahiko","family":"Sakai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/3-540-45657-0_47","volume-title":"Computer Aided Verification","author":"P.A. Abdulla","year":"2002","unstructured":"Abdulla, P.A., Jonsson, B., Mahata, P., d\u2019Orso, J.: Regular tree model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 555\u2013568. Springer, Heidelberg (2002)"},{"key":"13_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, New York (1998)"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1142\/S0129054101000412","volume":"12","author":"P. Borovansky","year":"2001","unstructured":"Borovansky, P., Kirchner, H., Kirchner, C., Ringeissen, C.: Rewriting with strategies in elan: a functional semantics. International Journal of Foundations of Computer Science (IJFCS)\u00a012(1), 69\u201395 (2001)","journal-title":"International Journal of Foundations of Computer Science (IJFCS)"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/11823230_5","volume-title":"Static Analysis","author":"A. Bouajjani","year":"2006","unstructured":"Bouajjani, A., Habermehl, P., Rogalewicz, A., Vojnar, T.: Abstract regular tree model checking of complex dynamic data structures. In: Yi, K. (ed.) SAS 2006. LNCS, vol.\u00a04134, pp. 52\u201370. Springer, Heidelberg (2006)"},{"key":"13_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-540-74621-8_17","volume-title":"Frontiers of Combining Systems","author":"J. Chabin","year":"2007","unstructured":"Chabin, J., R\u00e9ty, P.: Visibly pushdown languages and term rewriting. In: Konev, B., Wolter, F. (eds.) FroCos 2007. LNCS (LNAI), vol.\u00a04720, pp. 252\u2013266. Springer, Heidelberg (2007)"},{"key":"13_CR6","unstructured":"Chamberlin, D., Robie, J.: Xquery update facility 1.0. W3C Candidate Recommendation (2009), \n                    \n                      http:\/\/www.w3.org\/TR\/xquery-update-10\/"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1109\/LICS.1995.523285","volume-title":"Proc. 10th IEEE Symposium on Logic in Computer Science (LICS)","author":"H. Comon","year":"1995","unstructured":"Comon, H.: Sequentiality, second order monadic logic and tree automata. In: Proc. 10th IEEE Symposium on Logic in Computer Science (LICS), pp. 508\u2013517. IEEE Computer Society, Los Alamitos (1995)"},{"key":"13_CR8","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., L\u00f6ding, C., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (2007), \n                    \n                      http:\/\/tata.gforge.inria.fr"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-662-07675-0_3","volume-title":"Handbook of Formal Languages","author":"J. Dassow","year":"1997","unstructured":"Dassow, J., Paun, G., Salomaa, A.: Grammars with Controlled Derivations. In: Handbook of Formal Languages, vol.\u00a02, pp. 101\u2013154. Springer, Heidelberg (1997)"},{"issue":"2","key":"13_CR10","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.ic.2004.10.003","volume":"196","author":"I. Durand","year":"2005","unstructured":"Durand, I., Middeldorp, A.: Decidable call-by-need computations in term rewriting. Information and Computation\u00a0196(2), 95\u2013126 (2005)","journal-title":"Information and Computation"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF01683280","volume":"10","author":"J. Engelfriet","year":"1977","unstructured":"Engelfriet, J.: Top-down tree transducers with regular look-ahead. Mathematical Systems Theory\u00a010, 289\u2013303 (1977)","journal-title":"Mathematical Systems Theory"},{"issue":"3-4","key":"13_CR12","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10817-004-6246-0","volume":"33","author":"G. Feuillade","year":"2004","unstructured":"Feuillade, G., Genet, T., Tong, V.V.T.: Reachability analysis over term rewriting systems. J. Autom. Reasoning\u00a033(3-4), 341\u2013383 (2004)","journal-title":"J. Autom. Reasoning"},{"key":"13_CR13","volume-title":"Proc. of the 18th Annual IEEE Symposium on Logic in Computer Science","author":"M. Frick","year":"2003","unstructured":"Frick, M., Grohe, M., Koch, C.: Query evaluation on compressed trees. In: Proc. of the 18th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society, Los Alamitos (2003)"},{"issue":"1","key":"13_CR14","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/962446.962450","volume":"51","author":"G. Gottlob","year":"2004","unstructured":"Gottlob, G., Koch, C.: Monadic datalog and the expressive power of languages for web information extraction. Journal of the ACM\u00a051(1), 74\u2013113 (2004)","journal-title":"Journal of the ACM"},{"issue":"1","key":"13_CR15","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF01744582","volume":"16","author":"I. Guessarian","year":"1983","unstructured":"Guessarian, I.: Pushdown tree automata. Mathematical Systems Theory\u00a016(1), 237\u2013263 (1983)","journal-title":"Mathematical Systems Theory"},{"issue":"3","key":"13_CR16","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.tcs.2004.04.009","volume":"327","author":"D. Hofbauer","year":"2004","unstructured":"Hofbauer, D., Waldmann, J.: Deleting string rewriting systems preserve regularity. Theor. Comput. Sci.\u00a0327(3), 301\u2013317 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR17","first-page":"119","volume-title":"Proc. 12th ACM SIGPLAN International Symposium on Principles and Practice of Declarative Programming (PPDP)","author":"F. Jacquemard","year":"2010","unstructured":"Jacquemard, F., Rusinowitch, M.: Rewrite-based verification of XML updates. In: Proc. 12th ACM SIGPLAN International Symposium on Principles and Practice of Declarative Programming (PPDP), pp. 119\u2013130. ACM, New York (2010)"},{"issue":"1-3","key":"13_CR18","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.tcs.2006.12.030","volume":"375","author":"N.D. Jones","year":"2007","unstructured":"Jones, N.D., Andersen, N.: Flow analysis of lazy higher-order functional programs. Theoretical Computer Science\u00a0375(1-3), 120\u2013136 (2007)","journal-title":"Theoretical Computer Science"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-540-70590-1_13","volume-title":"Rewriting Techniques and Applications","author":"Y. Kojima","year":"2008","unstructured":"Kojima, Y., Sakai, M.: Innermost reachability and context sensitive reachability properties are decidable for linear right-shallow term rewriting systems. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol.\u00a05117, pp. 187\u2013201. Springer, Heidelberg (2008)"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0019-9958(64)90120-2","volume":"7","author":"S.Y. Kuroda","year":"1964","unstructured":"Kuroda, S.Y.: Classes of languages and linear-bounded automata. Information and Control\u00a07, 207\u2013223 (1964)","journal-title":"Information and Control"},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/S0890-5401(02)93176-7","volume":"178","author":"S. Lucas","year":"2002","unstructured":"Lucas, S.: Context-sensitive rewriting strategies. Inf. Comput.\u00a0178, 294\u2013343 (2002)","journal-title":"Inf. Comput."},{"issue":"1","key":"13_CR22","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/S0022-0000(02)00030-2","volume":"66","author":"T. Milo","year":"2003","unstructured":"Milo, T., Suciu, D., Vianu, V.: Typechecking for XML transformers. J. of Comp. Syst. Sci.\u00a066(1), 66\u201397 (2003)","journal-title":"J. of Comp. Syst. Sci."},{"issue":"2","key":"13_CR23","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1006\/inco.2002.3157","volume":"178","author":"T. Nagaya","year":"2002","unstructured":"Nagaya, T., Toyama, Y.: Decidability for left-linear growing term rewriting systems. Inf. Comput.\u00a0178(2), 499\u2013514 (2002)","journal-title":"Inf. Comput."},{"issue":"1-2","key":"13_CR24","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/S0304-3975(01)00301-2","volume":"275","author":"F. Neven","year":"2002","unstructured":"Neven, F., Schwentick, T.: Query automata over finite trees. Theoretical Computer Science\u00a0275(1-2), 633\u2013674 (2002)","journal-title":"Theoretical Computer Science"},{"key":"13_CR25","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/S0019-9958(74)91049-3","volume":"25","author":"M. Penttonen","year":"1974","unstructured":"Penttonen, M.: One-sided and two-sided context in formal grammars. Information and Control\u00a025, 371\u2013392 (1974)","journal-title":"Information and Control"},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1016\/j.jsc.2004.12.008","volume":"40","author":"P. R\u00e9ty","year":"2005","unstructured":"R\u00e9ty, P., Vuotto, J.: Tree automata for rewrite strategies. J. Symb. Comput.\u00a040, 749\u2013794 (2005)","journal-title":"J. Symb. Comput."},{"issue":"3","key":"13_CR27","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/0022-0000(88)90014-1","volume":"37","author":"K. Salomaa","year":"1988","unstructured":"Salomaa, K.: Deterministic tree pushdown automata and monadic tree rewriting systems. J. Comput. Syst. Sci.\u00a037(3), 367\u2013394 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/3-540-59340-3_7","volume-title":"Term Rewriting","author":"G. S\u00e9nizergues","year":"1995","unstructured":"S\u00e9nizergues, G.: Formal languages and word-rewriting. In: Comon, H., Jouannaud, J.-P. (eds.) TCS School 1993. LNCS, vol.\u00a0909, pp. 75\u201394. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24364-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T01:07:20Z","timestamp":1554685640000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24364-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642243639","9783642243646"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24364-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}