{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T10:40:05Z","timestamp":1776940805420,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540734475","type":"print"},{"value":"9783540734499","type":"electronic"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73449-9_6","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T16:49:53Z","timestamp":1187023793000},"page":"48-62","source":"Crossref","is-referenced-by-count":17,"title":["Rewriting Approximations for Fast Prototyping of Static Analyzers"],"prefix":"10.1007","author":[{"given":"Yohan","family":"Boichut","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Genet","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Jensen","sequence":"additional","affiliation":[]},{"given":"Luka","family":"Le Roux","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","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":"6_CR2","unstructured":"Bertelsen, P.: Semantics of Java Byte Code. Technical report, Technical University of Denmark (1997)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Boichut, Y., Genet, T., Jensen, T., Le Roux, L.: Rewriting Approximations for Fast Prototyping of Static Analyzers. Research Report RR 5997, INRIA (2006), http:\/\/www.irisa.fr\/lande\/genet\/publications.html","DOI":"10.1007\/978-3-540-73449-9_6"},{"key":"6_CR4","unstructured":"Bouajjani, A., Habermehl, P., Rogalewicz, A., Vojnar, T.: Abstract regular tree model checking. In: Proceedings of 7th International Workshop on Verification of Infinite-State Systems \u2013 INFINITY 2005, in BRICS Notes Series, vol.\u00a04, pp. 15\u201324 (2005)"},{"key":"6_CR5","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\/"},{"key":"6_CR6","first-page":"244","volume-title":"Rewrite Systems","author":"N. Dershowitz","year":"1990","unstructured":"Dershowitz, N., Jouannaud, J.-P.: Handbook of Theoretical Computer Science. In: Rewrite Systems, vol.\u00a0B(6), pp. 244\u2013320. Elsevier, North-Holland Also as: Research report 478, LRI (1990)"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/978-3-540-27813-9_46","volume-title":"Computer Aided Verification","author":"A. Farzan","year":"2004","unstructured":"Farzan, A., Chen, C., Meseguer, J., Rosu, G.: Formal analysis of java programs in javafan. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol.\u00a03114, pp. 501\u2013505. Springer, Heidelberg (2004)"},{"issue":"3-4","key":"6_CR8","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"},{"issue":"10","key":"6_CR9","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/320385.320397","volume":"34","author":"S.N. Freund","year":"1999","unstructured":"Freund, S.N., Mitchell, J.C.: A formal framework for the Java bytecode language and verifier. ACM SIGPLAN Notices\u00a034(10), 147\u2013166 (1999)","journal-title":"ACM SIGPLAN Notices"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BFb0052368","volume-title":"Proc. 9th RTA Conf.","author":"T. Genet","year":"1998","unstructured":"Genet, T.: Decidable approximations of sets of descendants and sets of normal forms. In: Nipkow, T. (ed.) Proc. 9th RTA Conf. LNCS, vol.\u00a01379, pp. 151\u2013165. Springer, Heidelberg (1998)"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/10719839","volume-title":"CADE-17","author":"T. Genet","year":"2000","unstructured":"Genet, T., Klay, F.: Rewriting for Cryptographic Protocol Verification. In: McAllester, D. (ed.) CADE-17. LNCS, vol.\u00a01831, Springer, Heidelberg (2000)"},{"key":"6_CR12","unstructured":"Genet, T., Tang-Talpin, Y.-M., Viet Triem\u00a0Tong, V.: Verification of Copy Protection Cryptographic Protocol using Approximations of Term Rewriting Systems. In: Proceedings of Workshop on Issues in the Theory of Security (2003)"},{"key":"6_CR13","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":"6_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. Fundamenta Informaticae\u00a024, 157\u2013175 (1995)","journal-title":"Fundamenta Informaticae"},{"key":"6_CR15","series-title":"Lecture Notes in Artificial Intelligence","first-page":"2","volume-title":"Proc. 19th CADE Conf.","author":"J. Meseguer","year":"2003","unstructured":"Meseguer, J., Palomino, M., Mart\u00ed-Oliet, N.: Equational Abstractions. In: Baader, F. (ed.) Proc. 19th CADE Conf. LNCS (LNAI), vol.\u00a02741, pp. 2\u201316. Springer, Heidelberg (2003)"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Meseguer, J., Rosu, G.: Rewriting logic semantics: From language specifications to formal analysis tools. In: IJCAR, pp. 1\u201344 (2004)","DOI":"10.1007\/978-3-540-25984-8_1"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Shivers, O.: The semantics of Scheme control-flow analysis. In: Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, vol.\u00a026, pp. 190\u2013198, New Haven, CN, (June 1991)","DOI":"10.1145\/115865.115884"},{"key":"6_CR18","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)"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73449-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T20:52:38Z","timestamp":1587847958000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73449-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540734475","9783540734499"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73449-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}