{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T17:49:29Z","timestamp":1725990569439},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319998398"},{"type":"electronic","value":"9783319998404"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99840-4_9","type":"book-chapter","created":{"date-parts":[[2018,9,7]],"date-time":"2018-09-07T07:29:08Z","timestamp":1536305348000},"page":"153-163","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Extending Timbuk to Verify Functional Programs"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Genet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tristan","family":"Gillard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timoth\u00e9e","family":"Haudebourg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9bastien","family":"L\u00ea\u00a0Cong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,8]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Avanzini, M., Dal Lago, U., Moser, G.: Analysing the complexity of functional programs: higher-order meets first-order. In: ICFP 2015, pp. 152\u2013164. ACM (2015)","DOI":"10.1145\/2858949.2784753"},{"issue":"1","key":"9_CR2","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"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/978-3-319-15579-1_51","volume-title":"Language and Automata Theory and Applications","author":"Y Boichut","year":"2015","unstructured":"Boichut, Y., Chabin, J., R\u00e9ty, P.: Towards more precise rewriting approximations. In: Dediu, A.-H., Formenti, E., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2015. LNCS, vol. 8977, pp. 652\u2013663. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15579-1_51"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71999-1","volume-title":"All About Maude - A High-Performance Logical Framework","author":"M Clavel","year":"2007","unstructured":"Clavel, M., et al.: All About Maude - A High-Performance Logical Framework. LNCS, vol. 4350. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71999-1"},{"key":"9_CR5","unstructured":"Comon, H., et al.: Tree Automata Techniques and Applications (2008). http:\/\/tata.gforge.inria.fr"},{"key":"9_CR6","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). https:\/\/doi.org\/10.1007\/BFb0052368"},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.jlamp.2015.05.003","volume":"85","author":"T Genet","year":"2016","unstructured":"Genet, T.: Termination criteria for tree automata completion. J. Log. Algebraic Methods Program. 85(1), 3\u201333 (2016). Part 1","journal-title":"J. Log. Algebraic Methods Program."},{"key":"9_CR8","unstructured":"Genet, T.: Automata Completion and Regularity Preservation. Technical report, INRIA (2017). https:\/\/hal.inria.fr\/hal-01501744"},{"key":"9_CR9","unstructured":"Genet, T., Boichut, Y., Boyer, B., Gillard, T., Haudebourg, T., L\u00ea Cong, S.: Timbuk 3.2 - a Tree Automata Library. IRISA\/Universit\u00e9 de Rennes 1 (2017). http:\/\/people.irisa.fr\/Thomas.Genet\/timbuk\/"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/978-3-319-89366-2_31","volume-title":"Foundations of Software Science and Computation Structures","author":"T Genet","year":"2018","unstructured":"Genet, T., Haudebourg, T., Jensen, T.: Verifying higher-order functions with tree automata. In: Baier, C., Dal Lago, U. (eds.) FoSSaCS 2018. LNCS, vol. 10803, pp. 565\u2013582. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89366-2_31"},{"key":"9_CR11","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, R.: Equational tree automata completion. J. Symb. Comput. 45, 574\u2013597 (2010)","journal-title":"J. Symb. Comput."},{"key":"9_CR12","unstructured":"Genet, T., Salmon, Y.: Reachability analysis of innermost rewriting. In: RTA 2015, volume 36 of LIPIcs, Warshaw. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/3-540-60360-3_38","volume-title":"Static Analysis","author":"J Giesl","year":"1995","unstructured":"Giesl, J.: Termination analysis for functional programs using term orderings. In: Mycroft, A. (ed.) SAS 1995. LNCS, vol. 983, pp. 154\u2013171. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60360-3_38"},{"key":"9_CR14","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. Fundam. Inform. 24, 157\u2013175 (1995)","journal-title":"Fundam. Inform."},{"key":"9_CR15","unstructured":"Guellouma, Y., Mignot, L., Cherroun, H., Ziadi, D.: Construction of rational expression from tree automata using a generalization of Arden\u2019s lemma. CoRR, abs\/1501.07686 (2015)"},{"issue":"1\u20133","key":"9_CR16","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.tcs.2006.12.030","volume":"375","author":"ND Jones","year":"2007","unstructured":"Jones, N.D., Andersen, N.: Flow analysis of lazy higher-order functional programs. Theor. Comput. Sci. 375(1\u20133), 120\u2013136 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0304-3975(92)90279-O","volume":"106","author":"E Kounalis","year":"1992","unstructured":"Kounalis, E.: Testing for the ground (co-)reducibility property in term-rewriting systems. TCS 106(1), 87\u2013117 (1992)","journal-title":"TCS"},{"issue":"3","key":"9_CR18","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1051\/ita\/2011107","volume":"45","author":"D Kuske","year":"2011","unstructured":"Kuske, D., Meinecke, I.: Construction of tree automata from regular expressions. RAIRO Theor. Inform. Appl. 45(3), 347\u2013370 (2011)","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-319-26529-2_16","volume-title":"Programming Languages and Systems","author":"Y Matsumoto","year":"2015","unstructured":"Matsumoto, Y., Kobayashi, N., Unno, H.: Automata-Based abstraction for automated verification of higher-order tree-processing programs. In: Feng, X., Park, S. (eds.) APLAS 2015. LNCS, vol. 9458, pp. 295\u2013312. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26529-2_16"},{"issue":"2\u20133","key":"9_CR20","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.tcs.2008.04.040","volume":"403","author":"J Meseguer","year":"2008","unstructured":"Meseguer, J., Palomino, M., Mart\u00ed-Oliet, N.: Equational abstractions. TCS 403(2\u20133), 239\u2013264 (2008)","journal-title":"TCS"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Ong, L., Ramsay, S.: Verifying higher-order functional programs with pattern-matching algebraic data types. In: POPL 2011. ACM (2011)","DOI":"10.1145\/1926385.1926453"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Wadler, P.: Theorems for free! In: Proceedings of FPCA 1989, pp. 347\u2013359. ACM (1989)","DOI":"10.1145\/99370.99404"}],"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-99840-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,9]],"date-time":"2020-11-09T00:15:06Z","timestamp":1604880906000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99840-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319998398","9783319998404"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99840-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}