{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:35:43Z","timestamp":1743107743734,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319155784"},{"type":"electronic","value":"9783319155791"}],"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-15579-1_51","type":"book-chapter","created":{"date-parts":[[2015,2,23]],"date-time":"2015-02-23T08:36:13Z","timestamp":1424680573000},"page":"652-663","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Towards More Precise Rewriting Approximations"],"prefix":"10.1007","author":[{"given":"Yohan","family":"Boichut","sequence":"first","affiliation":[]},{"given":"Jacques","family":"Chabin","sequence":"additional","affiliation":[]},{"given":"Pierre","family":"R\u00e9ty","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,24]]},"reference":[{"key":"51_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-34281-3_22","volume-title":"Formal Methods and Software Engineering","author":"Y Boichut","year":"2012","unstructured":"Boichut, Y., Boyer, B., Genet, T., Legay, A.: Equational Abstraction Refinement for Certified Tree Regular Model Checking. In: Aoki, T., Taguchi, K. (eds.) ICFEM 2012. LNCS, vol. 7635, pp. 299\u2013315. Springer, Heidelberg (2012)"},{"key":"51_CR2","first-page":"128","volume":"21","author":"Y Boichut","year":"2013","unstructured":"Boichut, Y., Chabin, J., R\u00e9ty, P.: Over-approximating descendants by synchronized tree languages. RTA. LIPIcs 21, 128\u2013142 (2013)","journal-title":"RTA. LIPIcs"},{"key":"51_CR3","doi-asserted-by":"crossref","unstructured":"Boichut, Y., Chabin, J., R\u00e9ty, P.: Towards more precise rewriting approximations (full version). Tech. Rep. RR-2014-02, LIFO, Universit\u00e9 d\u2019Orl\u00e9ans (2014)","DOI":"10.1007\/978-3-319-15579-1_51"},{"key":"51_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-540-70590-1_4","volume-title":"Rewriting Techniques and Applications","author":"Y Boichut","year":"2008","unstructured":"Boichut, Y., Courbis, R., H\u00e9am, P.-C., Kouchnarenko, O.: Finer Is Better: Abstraction Refinement for Rewriting Approximations. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol. 5117, pp. 48\u201362. Springer, Heidelberg (2008)"},{"issue":"1","key":"51_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ipl.2008.03.012","volume":"108","author":"Y Boichut","year":"2008","unstructured":"Boichut, Y., H\u00e9am, P.C.: A Theoretical Limit for Safety Verification Techniques with Regular Fix-point Computations. IPL 108(1), 1\u20132 (2008)","journal-title":"IPL"},{"issue":"2","key":"51_CR6","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10009-011-0205-y","volume":"14","author":"A Bouajjani","year":"2012","unstructured":"Bouajjani, A., Habermehl, P., Rogalewicz, A., Vojnar, T.: Abstract Regular (Tree) Model Checking. STTT 14(2), 167\u2013191 (2012)","journal-title":"STTT"},{"key":"51_CR7","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (TATA)"},{"key":"51_CR8","first-page":"361","volume":"10","author":"I Durand","year":"2011","unstructured":"Durand, I., Sylvestre, M.: Left-linear bounded trss are inverse recognizability preserving. RTA. LIPIcs 10, 361\u2013376 (2011)","journal-title":"RTA. LIPIcs"},{"key":"51_CR9","doi-asserted-by":"crossref","unstructured":"Engelfriet, J., Heyker, L.: Context-free Hypergraph Grammars have the same Term-generating Power as Attribute Grammars. Acta Informatica 29 (1992)","DOI":"10.1007\/BF01178504"},{"key":"51_CR10","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1007\/s002360050106","volume":"34","author":"J Engelfriet","year":"1997","unstructured":"Engelfriet, J., Vereijken, J.: Context-free Grammars and Concatenation of Graphs. Acta Informatica 34, 773\u2013803 (1997)","journal-title":"Acta Informatica"},{"issue":"3","key":"51_CR11","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). Journal of Computer and System Sciences 15(3), 328\u2013353 (1977)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"51_CR12","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). Journal of Computer and System Sciences 16(1), 67\u201399 (1978)","journal-title":"Journal of Computer and System Sciences"},{"key":"51_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BFb0052368","volume-title":"Rewriting Techniques and Applications","author":"T Genet","year":"1998","unstructured":"Genet, T.: Decidable Approximations of Sets of Descendants and Sets of Normal Forms. In: Nipkow, T. (ed.) RTA 1998. LNCS, vol. 1379, pp. 151\u2013165. Springer, Heidelberg (1998)"},{"key":"51_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/10721959_21","volume-title":"Automated Deduction - CADE-17","author":"T Genet","year":"2000","unstructured":"Genet, T., Klay, F.: Rewriting for cryptographic protocol verification. In: McAllester, D. (ed.) Automated Deduction - CADE-17. LNCS, vol. 1831, pp. 271\u2013290. Springer, Heidelberg (2000)"},{"key":"51_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/3-540-45315-6_14","volume-title":"Foundations of Software Science and Computation Structures","author":"V Gouranton","year":"2001","unstructured":"Gouranton, V., R\u00e9ty, P., Seidl, H.: Synchronized Tree Languages Revisited and New Applications. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol. 2030, pp. 214\u2013229. Springer, Heidelberg (2001)"},{"key":"51_CR16","first-page":"187","volume":"10","author":"J Kochems","year":"2011","unstructured":"Kochems, J., Ong, C.H.L.: Improved Functional Flow and Reachability Analyses Using Indexed Linear Tree Grammars. RTA. LIPIcs 10, 187\u2013202 (2011)","journal-title":"RTA. LIPIcs"},{"key":"51_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-540-25979-4_12","volume-title":"Rewriting Techniques and Applications","author":"S Limet","year":"2004","unstructured":"Limet, S., Salzer, G.: Proving Properties of Term Rewrite Systems via Logic Programs. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 170\u2013184. Springer, Heidelberg (2004)"},{"issue":"4","key":"51_CR18","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10817-006-9064-8","volume":"37","author":"S Limet","year":"2006","unstructured":"Limet, S., Salzer, G.: Tree Tuple Languages from the Logic Programming Point of View. Journal of Automated Reasoning 37(4), 323\u2013349 (2006)","journal-title":"Journal of Automated Reasoning"},{"key":"51_CR19","doi-asserted-by":"crossref","first-page":"149","DOI":"10.36045\/bbms\/1105730627","volume":"4","author":"J Raoult","year":"1997","unstructured":"Raoult, J.: Rational Tree Relations. Bulletin of the Belgian Mathematical Society Simon Stevin 4, 149\u2013176 (1997)","journal-title":"Bulletin of the Belgian Mathematical Society Simon Stevin"},{"key":"51_CR20","unstructured":"R\u00e9ty, P.: Langages synchronis\u00e9s d\u2019arbres et applications. Habilitation Thesis (in French). LIFO, Universit\u00e9 d\u2019Orl\u00e9ans. Tech. rep., June 2001"},{"key":"51_CR21","unstructured":"R\u00e9ty, P., Chabin, J., Chen, J.: R-Unification thanks to Synchronized-Contextfree Tree Languages. In: UNIF (2005)"},{"key":"51_CR22","unstructured":"R\u00e9ty, P., Chabin, J., Chen, J.: Synchronized ContextFree Tree-tuple Languages. Tech. Rep. RR-2006-13 (LIFO, 2006)"},{"key":"51_CR23","doi-asserted-by":"crossref","unstructured":"Rounds, W.C.: Context-free grammars on trees. In: Fischer, P.C., Ginsburg, S., Harrison, M.A. (eds.) STOC. ACM (1969)","DOI":"10.1145\/800169.805428"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15579-1_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T04:15:16Z","timestamp":1676434516000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15579-1_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319155784","9783319155791"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15579-1_51","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":"24 February 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}