{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:01:37Z","timestamp":1762459297278,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319214009"},{"type":"electronic","value":"9783319214016"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21401-6_9","type":"book-chapter","created":{"date-parts":[[2015,7,24]],"date-time":"2015-07-24T10:13:46Z","timestamp":1437732826000},"page":"137-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies"],"prefix":"10.1007","author":[{"given":"Florent","family":"Jacquemard","sequence":"first","affiliation":[]},{"given":"Yoshiharu","family":"Kojima","sequence":"additional","affiliation":[]},{"given":"Masahiko","family":"Sakai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,25]]},"reference":[{"key":"9_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":"PA 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. 2404, pp. 555\u2013568. Springer, Heidelberg (2002)"},{"key":"9_CR2","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. 4134, pp. 52\u201370. Springer, Heidelberg (2006)"},{"key":"9_CR3","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., L\u00f6ding, C., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (2007). http:\/\/tata.gforge.inria.fr"},{"key":"9_CR4","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: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 2, pp. 101\u2013154. Springer, Heidelberg (1997)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/3-540-17220-3_9","volume-title":"Rewriting Techniques and Applications","author":"M Dauchet","year":"1987","unstructured":"Dauchet, M., De Comite, F.: A Gap Between linear and non-linear term-rewriting systems. In: Lescanne, P. (ed.) Rewriting Techniques and Applications. LNCS, vol. 256, pp. 95\u2013104. Springer, Heidelberg (1987)"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-540-73449-9_10","volume-title":"Term Rewriting and Applications","author":"I Durand","year":"2007","unstructured":"Durand, I., S\u00e9nizergues, G.: Bottom-up rewriting is inverse recognizability preserving. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 107\u2013121. Springer, Heidelberg (2007)"},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0022-0000(78)90051-X","volume":"16","author":"J Engelfriet","year":"1978","unstructured":"Engelfriet, J., Schmidt, E.M.: IO and OI. II. J. Comput. Syst. Sci. 16(1), 67\u201399 (1978)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3\u20134","key":"9_CR8","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 33(3\u20134), 341\u2013383 (2004)","journal-title":"J. Autom. Reasoning"},{"issue":"1","key":"9_CR9","first-page":"83","volume":"14","author":"Z F\u00fcl\u00f6p","year":"1999","unstructured":"F\u00fcl\u00f6p, Z., Jurvanen, E., Steinby, M., V\u00e1gv\u00f6lgyi, S.: On one-pass term rewriting. Acta Cybernetica 14(1), 83\u201398 (1999)","journal-title":"Acta Cybernetica"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Futatsugi, K., Goguen, J.A., Jouannaud, J.-P., Meseguer, J.: Principles of OBJ2. In: Proceedings 12th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL), pp. 52\u201366 (1985)","DOI":"10.1145\/318593.318610"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-642-24364-6_13","volume-title":"Frontiers of Combining Systems","author":"F Jacquemard","year":"2011","unstructured":"Jacquemard, F., Kojima, Y., Sakai, M.: Controlled term rewriting. In: Tinelli, C., Sofronie-Stokkermans, V. (eds.) FroCoS 2011. LNCS, vol. 6989, pp. 179\u2013194. springer, Heidelberg (2011)"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-642-37064-9_33","volume-title":"Language and Automata Theory and Applications","author":"F Jacquemard","year":"2013","unstructured":"Jacquemard, F., Rusinowitch, M.: Rewrite closure and CF hedge automata. In: Dediu, A.-H., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2013. LNCS, vol. 7810, pp. 371\u2013382. Springer, Heidelberg (2013)"},{"issue":"1\u20133","key":"9_CR13","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.tcs.2006.12.030","volume":"375","author":"ND Jones","year":"2007","unstructured":"Jones, N.D., Andersen, N.: Flow analysis of lazy higher-order functional programs. Theor. Comput. Sci. 375(1\u20133), 120\u2013136 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR14","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. 5117, pp. 187\u2013201. Springer, Heidelberg (2008)"},{"key":"9_CR15","series-title":"Cambridge Tracts in TCS","volume-title":"Term Rewriting Systems by Terese","year":"2003","unstructured":"de Vrijer, R., Bezem, M., Klop, J.W. (eds.): Term Rewriting Systems by Terese. Cambridge Tracts in TCS, vol. 55. Cambridge University Press, Cambridge (2003)"},{"issue":"1","key":"9_CR16","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. Comput. Syst. Sci. 66(1), 66\u201397 (2003)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"9_CR17","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. 178(2), 499\u2013514 (2002)","journal-title":"Inf. Comput."},{"key":"9_CR18","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. Inf. Control 25, 371\u2013392 (1974)","journal-title":"Inf. Control"},{"key":"9_CR19","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. Symbolic Comput. 40, 749\u2013794 (2005)","journal-title":"J. Symbolic Comput."},{"issue":"3","key":"9_CR20","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0304-3975(90)90048-M","volume":"71","author":"G S\u00e9nizergues","year":"1990","unstructured":"S\u00e9nizergues, G.: Some decision problems about controlled rewriting systems. Theor. Comput. Sci. 71(3), 281\u2013346 (1990)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Automated Deduction - CADE-25"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21401-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T10:41:56Z","timestamp":1676025716000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21401-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319214009","9783319214016"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21401-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"25 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}