{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T00:41:22Z","timestamp":1775868082875,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642392733","type":"print"},{"value":"9783642392740","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39274-0_13","type":"book-chapter","created":{"date-parts":[[2013,7,10]],"date-time":"2013-07-10T21:07:42Z","timestamp":1373490462000},"page":"134-145","source":"Crossref","is-referenced-by-count":5,"title":["A Completion Algorithm for Lattice Tree Automata"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Genet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tristan","family":"Le Gall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Axel","family":"Legay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Val\u00e9rie","family":"Murat","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, p. 555. Springer, Heidelberg (2002)"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press (1998)","DOI":"10.1017\/CBO9781139172752"},{"key":"13_CR3","unstructured":"Barr\u00e9, N., Besson, F., Genet, T., Hubert, L., Le Roux, L.: Copster homepage (2009), \n                    \n                      http:\/\/www.irisa.fr\/celtique\/genet\/copster"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-642-22993-0_9","volume-title":"Mathematical Foundations of Computer Science 2011","author":"S.S. Bauer","year":"2011","unstructured":"Bauer, S.S., Fahrenberg, U., Juhl, L., Larsen, K.G., Legay, A., Thrane, C.: Quantitative refinement for weighted modal transition systems. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol.\u00a06907, pp. 60\u201371. Springer, Heidelberg (2011)"},{"key":"13_CR5","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.\u00a07635, pp. 299\u2013315. Springer, Heidelberg (2012)"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-540-73449-9_6","volume-title":"Term Rewriting and Applications","author":"Y. Boichut","year":"2007","unstructured":"Boichut, Y., Genet, T., Jensen, T., Le Roux, L.: Rewriting Approximations for Fast Prototyping of Static Analyzers. In: Baader, F. (ed.) RTA 2007. LNCS, vol.\u00a04533, pp. 48\u201362. Springer, Heidelberg (2007)"},{"issue":"3","key":"13_CR7","first-page":"216","volume":"14","author":"Y. Boichut","year":"2008","unstructured":"Boichut, Y., H\u00e9am, P.-C., Kouchnarenko, O.: Approximation-based tree regular model-checking. Nord. J. Comput.\u00a014(3), 216\u2013241 (2008)","journal-title":"Nord. J. Comput."},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/3-540-45657-0_46","volume-title":"Computer Aided Verification","author":"A. Bouajjani","year":"2002","unstructured":"Bouajjani, A., Touili, T.: Extrapolating tree transformations. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, p. 539. Springer, Heidelberg (2002)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL, pp. 238\u2013252 (1977)","DOI":"10.1145\/512950.512973"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"1450","DOI":"10.1016\/j.fss.2007.02.016","volume":"158","author":"Z. \u00c9sik","year":"2007","unstructured":"\u00c9sik, Z., Liu, G.: Fuzzy tree automata. Fuzzy Sets Syst.\u00a0158, 1450\u20131460 (2007)","journal-title":"Fuzzy Sets Syst."},{"issue":"3-4","key":"13_CR11","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., Viet Triem Tong, V.: Reachability Analysis over Term Rewriting Systems. JAR\u00a033(3-4), 341\u2013383 (2004)","journal-title":"JAR"},{"key":"13_CR12","unstructured":"Figueira, D., Segoufin, L.: Bottom-up automata on data trees and vertical xpath. In: STACS (2011)"},{"key":"13_CR13","unstructured":"Genest, B., Muscholl, A., Wu, Z.: Verifying recursive active documents with positive data tree rewriting. In: FSTTCS (2010)"},{"key":"13_CR14","unstructured":"Timbuk, T.G.: \n                    \n                      http:\/\/www.irisa.fr\/celtique\/genet\/timbuk\/"},{"key":"13_CR15","unstructured":"Genet, T., Le Gall, T., Legay, A., Murat, V.: Tree regular model checking for lattice-based automata. Technical Report RT-0424, INRIA (2012), \n                    \n                      http:\/\/hal.inria.fr\/hal-00687310"},{"issue":"5","key":"13_CR16","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1016\/j.jsc.2010.01.009","volume":"45","author":"T. Genet","year":"2010","unstructured":"Genet, T., Rusu, V.: Equational approximations for tree automata completion. Journal of Symbolic Computation\u00a045(5), 574\u2013597 (2010)","journal-title":"Journal of Symbolic Computation"},{"key":"13_CR17","unstructured":"Genet, T., Salmon, Y.: Tree Automata Completion for Static Analysis of Functional Programs. Technical report, INRIA (2013), \n                    \n                      http:\/\/hal.archives-ouvertes.fr\/hal-00780124\/PDF\/main.pdf"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-51081-8_108","volume-title":"Rewriting Techniques and Applications","author":"S. Kaplan","year":"1989","unstructured":"Kaplan, S., Choppy, C.: Abstract rewriting with concrete operations. In: Dershowitz, N. (ed.) RTA 1989. LNCS, vol.\u00a0355, pp. 178\u2013186. Springer, Heidelberg (1989)"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-69738-1_14","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"O. Kupferman","year":"2007","unstructured":"Kupferman, O., Lustig, Y.: Lattice automata. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol.\u00a04349, pp. 199\u2013213. Springer, Heidelberg (2007)"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-74061-2_4","volume-title":"Static Analysis","author":"T. Gall Le","year":"2007","unstructured":"Le Gall, T., Jeannet, B.: Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification. In: Riis Nielson, H., Fil\u00e9, G. (eds.) SAS 2007. LNCS, vol.\u00a04634, pp. 52\u201368. Springer, Heidelberg (2007)"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Leroux, J.: Structural Presburger digit vector automata. TCS\u00a0409(3) (2008)","DOI":"10.1016\/j.tcs.2008.09.037"},{"key":"13_CR22","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-45085-6_2","volume-title":"Automated Deduction \u2013 CADE-19","author":"J. Meseguer","year":"2003","unstructured":"Meseguer, J., Palomino, M., Mart\u00ed-Oliet, N.: Equational Abstractions. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol.\u00a02741, pp. 2\u201316. Springer, Heidelberg (2003)"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Otto, C., Brockschmidt, M., von Essen, C., Giesl, J.: Automated termination analysis of java bytecode by term rewriting. In: RTA. LIPIcs. Dagstuhl (2010)","DOI":"10.1007\/978-3-642-17172-7_2"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39274-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T14:33:48Z","timestamp":1557930828000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39274-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392733","9783642392740"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39274-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}