{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:50:32Z","timestamp":1762458632713},"publisher-location":"Berlin, Heidelberg","reference-count":18,"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_44","type":"book-chapter","created":{"date-parts":[[2008,8,29]],"date-time":"2008-08-29T05:56:30Z","timestamp":1219989390000},"page":"539-554","source":"Crossref","is-referenced-by-count":8,"title":["Automated Induction with Constrained Tree Automata"],"prefix":"10.1007","author":[{"given":"Adel","family":"Bouhoula","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florent","family":"Jacquemard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"44_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1006\/jsco.1996.0076","volume":"23","author":"A. Bouhoula","year":"1997","unstructured":"Bouhoula, A.: Automated theorem proving by test set induction. Journal of Symbolic Computation\u00a023(1), 47\u201377 (1997)","journal-title":"Journal of Symbolic Computation"},{"key":"44_CR2","unstructured":"Bouhoula, A., Jacquemard, F.: Verifying regular trace properties of security protocols with explicit destructors and implicit induction. In: Proc. of the workshop FCS-ARSPA, pp. 27\u201344 (2007)"},{"key":"44_CR3","unstructured":"Bouhoula, A., Jacquemard, F.: Automated induction with constrained tree automata. Research Report LSV-08-07, http:\/\/www.lsv.ens-cachan.fr\/Publis"},{"issue":"1","key":"44_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.2001.3036","volume":"169","author":"A. Bouhoula","year":"2001","unstructured":"Bouhoula, A., Jouannaud, J.-P.: Automata-driven automated induction. Information and Computation\u00a0169(1), 1\u201322 (2001)","journal-title":"Information and Computation"},{"issue":"1-2","key":"44_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0304-3975(99)00206-6","volume":"236","author":"A. Bouhoula","year":"2000","unstructured":"Bouhoula, A., Jouannaud, J.-P., Meseguer, J.: Specification and proof in membership equational logic. Theoretical Computer Science\u00a0236(1-2), 35\u2013132 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"44_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF00881856","volume":"14","author":"A. Bouhoula","year":"1995","unstructured":"Bouhoula, A., Rusinowitch, M.: Implicit induction in conditional theories. Journal of Automated Reasoning\u00a014(2), 189\u2013235 (1995)","journal-title":"Journal of Automated Reasoning"},{"key":"44_CR7","unstructured":"Comon, H.: Unification et disunification. Th\u00e9ories et applications. PhD thesis, Institut Polytechnique de Grenoble (France) (1988)"},{"key":"44_CR8","unstructured":"H.\u00a0Comon, M.\u00a0Dauchet, R.\u00a0Gilleron, F.\u00a0Jacquemard, C.\u00a0L\u00f6ding, D.\u00a0Lugiez, S.\u00a0Tison, and M.\u00a0Tommasi. Tree automata techniques and applications (2007), http:\/\/www.grappa.univ-lille3.fr\/tata"},{"issue":"1","key":"44_CR9","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0890-5401(03)00134-2","volume":"187","author":"H. Comon","year":"2003","unstructured":"Comon, H., Jacquemard, F.: Ground reducibility is exptime-complete. Information and Computation\u00a0187(1), 123\u2013153 (2003)","journal-title":"Information and Computation"},{"key":"44_CR10","volume-title":"Handbook of Automated Reasoning","author":"H. Comon-Lundh","year":"2001","unstructured":"Comon-Lundh, H.: Handbook of Automated Reasoning, ch.\u00a014. Elsevier, Amsterdam (2001)"},{"key":"44_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-540-71389-0_13","volume-title":"Foundations of Software Science and Computational Structures","author":"H. Comon-Lundh","year":"2007","unstructured":"Comon-Lundh, H., Jacquemard, F., Perrin, N.: Tree automata with memory, visibility and structural constraints. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol.\u00a04423, pp. 168\u2013182. Springer, Heidelberg (2007)"},{"key":"44_CR12","unstructured":"Davis, J.: Finite set theory based on fully ordered lists. In: In 5th International Workshop on the ACL2 Theorem Prover and Its Applications (ACL2, 2004) Sets Library Website (2004), http:\/\/www.cs.utexas.edu\/users\/jared\/osets\/Web"},{"key":"44_CR13","first-page":"243","volume-title":"Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics","author":"N. Dershowitz","year":"1990","unstructured":"Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics, pp. 243\u2013320. MIT Press, Cambridge (1990)"},{"key":"44_CR14","doi-asserted-by":"crossref","unstructured":"Jacquemard, F., Rusinowitch, M., Vigneron, L.: Tree automata with equality constraints modulo equational theories. Journal of Logic and Algebraic Programming (to appear, 2008)","DOI":"10.1016\/j.jlap.2007.10.006"},{"key":"44_CR15","volume-title":"Essays in Honor of Larry Wos","author":"D. Kapur","year":"1997","unstructured":"Kapur, D.: Constructors can be partial too. In: Essays in Honor of Larry Wos, MIT Press, Cambridge (1997)"},{"issue":"3","key":"44_CR16","first-page":"9","volume":"4","author":"C. Kirchner","year":"1990","unstructured":"Kirchner, C., Kirchner, H., Rusinowitch, M.: Deduction with symbolic constraints. Revue d\u2019Intelligence Artificielle\u00a04(3), 9\u201352 (1990); Special issue on Automatic Deduction","journal-title":"Revue d\u2019Intelligence Artificielle"},{"issue":"4","key":"44_CR17","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1006\/jsco.2000.0469","volume":"32","author":"S. Stratulat","year":"2001","unstructured":"Stratulat, S.: A general framework to build contextual cover set induction provers. Journal of Symbolic Computation\u00a032(4), 403\u2013445 (2001)","journal-title":"Journal of Symbolic Computation"},{"key":"44_CR18","doi-asserted-by":"crossref","unstructured":"Zhang, H.: Implementing contextual rewriting. In: Proc. 3rd Int. Workshop on Conditional Term Rewriting Systems (1992)","DOI":"10.1007\/3-540-56393-8_28"}],"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_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:15:15Z","timestamp":1605744915000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71070-7_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540710691","9783540710707"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71070-7_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}