{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:40:26Z","timestamp":1725518426114},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540710691"},{"type":"electronic","value":"9783540710707"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71070-7_43","type":"book-chapter","created":{"date-parts":[[2008,8,29]],"date-time":"2008-08-29T09:56:30Z","timestamp":1220003790000},"page":"523-538","source":"Crossref","is-referenced-by-count":4,"title":["Certifying a Tree Automata Completion Checker"],"prefix":"10.1007","author":[{"given":"Beno\u00eet","family":"Boyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Genet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Jensen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"43_CR1","series-title":"Lecture Notes in Computer Science","first-page":"541","volume-title":"Computer Aided Verification","author":"A. Armando","year":"2005","unstructured":"Armando, A., Basin, D., Boichut, Y., Chevalier, Y., Compagna, L., Cuellar, J., Hankes Drielsma, P., H\u00e9am, P.-C., Kouchnarenko, O., Mantovani, J., M\u00f6dersheim, S., von Oheimb, D., Rusinowitch, M., Santos Santiago, J., Turuani, M., Vigan\u00f2, L., Vigneron, L.: Natural deduction with general elimination rules. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 541\u2013567. Springer, Heidelberg (2005)"},{"key":"43_CR2","unstructured":"Ballad, E., Boichut, Y., Genet, T., Moreau, P.-E.: Towards an Efficient Implementation of Tree Automata Completion. In: AMAST 2008 (to be published, 2008)"},{"key":"43_CR3","series-title":"Texts in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07964-5","volume-title":"Interactive Theorem Proving and Program Development. Coq\u2019Art: The Calculus of Inductive Constructions","author":"Y. Bertot","year":"2004","unstructured":"Bertot, Y., Cast\u00e9ran, P.: Interactive Theorem Proving and Program Development. Coq\u2019Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science. Springer, Heidelberg (2004)"},{"key":"43_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/978-3-540-24721-0_7","volume-title":"Fundamental Approaches to Software Engineering","author":"G. Barthe","year":"2004","unstructured":"Barthe, G., Dufay, G.: A tool-assisted framework for certified bytecode verification. In: Wermelinger, M., Margaria-Steffen, T. (eds.) FASE 2004. LNCS, vol.\u00a02984, pp. 99\u2013113. Springer, Heidelberg (2004)"},{"key":"43_CR5","unstructured":"Boyer, B., Genet, T., Jensen, T.: Certifying a Tree Automata Completion Checker. Technical Report RR 6462, INRIA (2008), http:\/\/hal.inria.fr\/inria-00258275\/fr\/"},{"key":"43_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., Leroux, L.: Rewriting Approximations for Fast Prototyping of Static Analyzers. In: Baader, F. (ed.) RTA 2007. LNCS, vol.\u00a04533, pp. 48\u201362. Springer, Heidelberg (2007)"},{"key":"43_CR7","unstructured":"Boichut, Y., H\u00e9am, P.-C., Kouchnarenko, O.: Automatic Approximation for the Verification of Cryptographic Protocols. In: Proc. AVIS 2004, joint to ETAPS 2004, Barcelona (Spain) (2004)"},{"issue":"3","key":"43_CR8","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.tcs.2006.08.012","volume":"364","author":"F. Besson","year":"2006","unstructured":"Besson, F., Jensen, T., Pichardie, D.: Proof-carrying code from certified abstract interpretation and fixpoint compression. Theor. Comput. Sci.\u00a0364(3), 273\u2013291 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"43_CR9","doi-asserted-by":"crossref","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, Cambridge (1998)"},{"key":"43_CR10","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2002), http:\/\/www.grappa.univ-lille3.fr\/tata\/"},{"issue":"1","key":"43_CR11","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.tcs.2005.06.004","volume":"342","author":"D. Cachera","year":"2005","unstructured":"Cachera, D., Jensen, T., Pichardie, P., Rusu, V.: Extracting a data flow analyser in constructive logic. Theor. Comput. Sci.\u00a0342(1), 56\u201378 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"3-4","key":"43_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., Viet Triem Tong, V.: Reachability Analysis over Term Rewriting Systems. JAR\u00a033(3-4), 341\u2013383 (2004)","journal-title":"JAR"},{"key":"43_CR13","doi-asserted-by":"crossref","unstructured":"Genet, T.: Decidable approximations of sets of descendants and sets of normal forms (extended version). Technical Report RR-3325, INRIA (1997)","DOI":"10.1007\/BFb0052368"},{"key":"43_CR14","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.\u00a01379, pp. 151\u2013165. Springer, Heidelberg (1998)"},{"key":"43_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.\u00a01831. Springer, Heidelberg (2000)"},{"key":"43_CR16","doi-asserted-by":"crossref","first-page":"157","DOI":"10.3233\/FI-1995-24127","volume":"24","author":"R. Gilleron","year":"1995","unstructured":"Gilleron, R., Tison, S.: Regular tree languages and rewrite systems. Fundamenta Informaticae\u00a024, 157\u2013175 (1995)","journal-title":"Fundamenta Informaticae"},{"key":"43_CR17","unstructured":"Genet, T., Tang-Talpin, Y.-M., Viet Triem Tong, V.: Verification of Copy Protection Cryptographic Protocol using Approximations of Term Rewriting Systems. In: WITS 2003 (2003)"},{"key":"43_CR18","unstructured":"Genet, T., Viet Triem Tong, V.: Timbuk 2.0 \u2013 a Tree Automata Library. IRISA \/ Universit\u00e9 de Rennes 1 (2000), http:\/\/www.irisa.fr\/lande\/genet\/timbuk\/"},{"key":"43_CR19","first-page":"362","volume-title":"Proc. 7th RTA Conf., New Brunswick (New Jersey, USA)","author":"F. Jacquemard","year":"1996","unstructured":"Jacquemard, F.: Decidable approximations of term rewriting systems. In: Ganzinger, H. (ed.) Proc. 7th RTA Conf., New Brunswick (New Jersey, USA), pp. 362\u2013376. Springer, Heidelberg (1996)"},{"key":"43_CR20","doi-asserted-by":"crossref","unstructured":"Klein, G., Nipkow, T.: Verified bytecode verifiers. TCS\u00a0298 (2003)","DOI":"10.1016\/S0304-3975(02)00869-1"},{"key":"43_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44659-1_24","volume-title":"Theorem Proving in Higher Order Logics","author":"P. Letouzey","year":"2000","unstructured":"Letouzey, P., Th\u00e9ry, L.: Formalizing stalmarck\u2019s algorithm in coq. In: Aagaard, M.D., Harrison, J. (eds.) TPHOLs 2000. LNCS, vol.\u00a01869. Springer, Heidelberg (2000)"},{"key":"43_CR22","series-title":"Lecture Notes in Computer Science","volume-title":"Logic Programming and Automated Reasoning","author":"P. Rety","year":"1999","unstructured":"Rety, P.: Regular Sets of Descendants for Constructor-based Rewrite Systems. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds.) LPAR 1999. LNCS, vol.\u00a01705. Springer. Heidelberg (1999)"},{"key":"43_CR23","series-title":"Lecture Notes in Computer Science","volume-title":"Proc. of TPHOL 2001","author":"X. Rival","year":"2001","unstructured":"Rival, X., Goubault-Larrecq, J.: Experiments with finite tree automata in coq. In: Proc. of TPHOL 2001. LNCS. Springer, Heidelberg (2001)"},{"key":"43_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/978-3-540-25979-4_9","volume-title":"Rewriting Techniques and Applications","author":"T. Takai","year":"2004","unstructured":"Takai, T.: A Verification Technique Using Term Rewriting Systems and Abstract Interpretation. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 119\u2013133. Springer, Heidelberg (2004)"},{"key":"43_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/11690634_28","volume-title":"Foundations of Software Science and Computation Structures","author":"R. Zunino","year":"2006","unstructured":"Zunino, R., Degano, P.: Handling exp, \u00d7 (and timestamps) in protocol analysis. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FOSSACS 2006 and ETAPS 2006. LNCS, vol.\u00a03921, pp. 413\u2013427. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71070-7_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:15:15Z","timestamp":1605762915000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71070-7_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540710691","9783540710707"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71070-7_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}