{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:25:59Z","timestamp":1725863159957},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319448015"},{"type":"electronic","value":"9783319448022"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-44802-2_4","type":"book-chapter","created":{"date-parts":[[2016,8,17]],"date-time":"2016-08-17T12:32:52Z","timestamp":1471437172000},"page":"64-81","source":"Crossref","is-referenced-by-count":0,"title":["Synchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems"],"prefix":"10.1007","author":[{"given":"Yohan","family":"Boichut","sequence":"first","affiliation":[]},{"given":"Vivien","family":"Pelletier","sequence":"additional","affiliation":[]},{"given":"Pierre","family":"R\u00e9ty","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,18]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Boichut, Y., Boyer, B., Genet, Th., 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)","DOI":"10.1007\/978-3-642-34281-3_22"},{"key":"4_CR2","unstructured":"Boichut, Y., Chabin, J., R\u00e9ty, P.: Over-approximating descendants by synchronized tree languages. In: RTA, vol. 21 of LIPIcs, pp. 128\u2013142 (2013)"},{"key":"4_CR3","unstructured":"Boichut, Y., Chabin, J., R\u00e9ty, P.: Erratum of over-approximating descendants by synchronized tree languages. Technical report, LIFO, Universit\u00e9 d\u2019Orl\u00e9ans (2015). http:\/\/www.univ-orleans.fr\/lifo\/Members\/rety\/publications.html#erratum"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"4_CR5","doi-asserted-by":"crossref","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":"4_CR6","doi-asserted-by":"crossref","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. J. Softw. Tools Technol. Transf. 14(2), 167\u2013191 (2012)","journal-title":"J. Softw. Tools Technol. Transf."},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.) CADE 2000. LNCS, vol. 1831, pp. 271\u2013290. Springer, Heidelberg (2000)"},{"key":"4_CR8","unstructured":"Genet, T., Salmon, Y.: Reachability analysis of innermost rewriting. In: RTA, vol. 36 (2015)"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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, p. 214. Springer, Heidelberg (2001)"},{"key":"4_CR10","unstructured":"Kochems, J., Luke Ong, C.-H.: Improved functional flow and reachability analyses using indexed linear tree grammars. In: RTA, vol. 10 of LIPIcs, pp. 187\u2013202 (2011)"},{"issue":"1","key":"4_CR11","first-page":"69","volume":"1","author":"S Limet","year":"1997","unstructured":"Limet, S., R\u00e9ty, P.: E-unification by means of tree tuple synchronized grammars. Discret. Math. Theorit. Comput. Sci. 1(1), 69\u201398 (1997)","journal-title":"Discret. Math. Theorit. Comput. Sci."},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"4_CR13","doi-asserted-by":"crossref","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. J. Autom. Reason. 37(4), 323\u2013349 (2006)","journal-title":"J. Autom. Reason."}],"container-title":["Lecture Notes in Computer Science","Rewriting Logic and Its Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44802-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T16:53:17Z","timestamp":1498323197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44802-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319448015","9783319448022"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44802-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}