{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:37:05Z","timestamp":1725543425146},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540368342"},{"type":"electronic","value":"9783540368359"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11805618_10","type":"book-chapter","created":{"date-parts":[[2006,7,25]],"date-time":"2006-07-25T10:29:13Z","timestamp":1153823353000},"page":"123-135","source":"Crossref","is-referenced-by-count":2,"title":["Feasible Trace Reconstruction for Rewriting Approximations"],"prefix":"10.1007","author":[{"given":"Yohan","family":"Boichut","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Genet","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/11513988_27","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.: The AVISPA Tool for the automated validation of internet security protocols and applications. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 281\u2013285. Springer, Heidelberg (2005)"},{"key":"10_CR2","unstructured":"Boichut, Y., Genet, Th.: Trace reconstruction. Research Report RR2006-02, LIFC - Laboratoire d\u2019Informatique de l\u2019Universit\u00e9 de Franche Comt\u00e9and IRISA \/ Universit\u00e9 de Rennes (2006), http:\/\/lifc.univ-fcomte.fr\/publis\/papers\/Year\/2006.html"},{"key":"10_CR3","unstructured":"Boichut, Y., H\u00e9am, P.-C., Kouchnarenko, O.: Automatic Verification of Security Protocols Using Approximations. Research Report RR-5727, INRIA-Lorraine - CASSIS Project (October 2005)"},{"key":"10_CR4","series-title":"ENTCS","volume-title":"Proc. 2nd WRLA","author":"P. Borovansk\u00fd","year":"1998","unstructured":"Borovansk\u00fd, P., Kirchner, C., Kirchner, H., Moreau, P.-E., Ringeissen, C.: An overview of f elan. In: Proc. 2nd WRLA, Pont-\u00e0-mousson (France). ENTCS. Elsevier, Amsterdam (1998)"},{"key":"10_CR5","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":"10_CR6","doi-asserted-by":"crossref","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Quesada, J.F.: Maude: Specification and programming in rewriting logic. Theoretical Computer Science (2001)","DOI":"10.1016\/S0304-3975(01)00359-0"},{"key":"10_CR7","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":"3-4","key":"10_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., Tong, V.V.T.: Reachability Analysis over Term Rewriting Systems. JAR\u00a033(3-4), 341\u2013383 (2004)","journal-title":"JAR"},{"key":"10_CR9","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":"10_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-540-45085-6_27","volume-title":"Automated Deduction \u2013 CADE-19","author":"J.-M. Gaillourdet","year":"2003","unstructured":"Gaillourdet, J.-M., Hillenbrand, T., L\u00f6chner, B., Spies, H.: The new Waldmeister loop at work. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol.\u00a02741, pp. 317\u2013321. Springer, Heidelberg (2003)"},{"key":"10_CR11","series-title":"Lecture Notes in Artificial Intelligence","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 (LNAI), vol.\u00a01831. Springer, Heidelberg (2000)"},{"key":"10_CR12","unstructured":"Genet, T., Tang-Talpin, Y.-M., Tong, V.V.T.: Verification of Copy Protection Cryptographic Protocol using Approximations of Term Rewriting Systems. In: Proc. of WITS 2003 (2003)"},{"issue":"1-2","key":"10_CR13","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0304-3975(96)00333-7","volume":"194","author":"P. Gyenizse","year":"1998","unstructured":"Gyenizse, P., V\u00e1gv\u00f6lgyi, S.: Linear Generalized Semi-Monadic Rewrite Systems Effectively Preserve Recognizability. TCS\u00a0194(1-2), 87\u2013122 (1998)","journal-title":"TCS"},{"key":"10_CR14","unstructured":"Genet, T., Tong, V.V.T.: Timbuk 2.0 \u2013 a Tree Automata Library. IRISA \/ Universit\u00e9 de Rennes 1 (2000), http:\/\/www.irisa.fr\/lande\/genet\/timbuk\/"},{"key":"10_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/3-540-45653-8_48","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"T. Genet","year":"2001","unstructured":"Genet, T., Tong, V.V.T.: Reachability Analysis of Term Rewriting Systems with timbuk. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, pp. 695\u2013702. Springer, Heidelberg (2001)"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1007\/3-540-61464-8_65","volume-title":"Rewriting Techniques and Applications","author":"F. Jacquemard","year":"1996","unstructured":"Jacquemard, F.: Decidable approximations of term rewriting systems. In: Ganzinger, H. (ed.) RTA 1996. LNCS, vol.\u00a01103, pp. 362\u2013376. Springer, Heidelberg (1996)"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/3-540-48294-6_10","volume-title":"Static Analysis","author":"D. Monniaux","year":"1999","unstructured":"Monniaux, D.: Abstracting Cryptographic Protocols with Tree Automata. In: Cortesi, A., Fil\u00e9, G. (eds.) SAS 1999. LNCS, vol.\u00a01694, p. 149. Springer, Heidelberg (1999)"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","first-page":"34","volume-title":"Proceedings of FASE 2003","author":"F. Oehl","year":"2003","unstructured":"Oehl, F., C\u00e9c\u00e9, G., Kouchnarenko, O., Sinclair, D.: Automatic Approximation for the Verification of Cryptographic Protocols. In: Proceedings of FASE 2003. LNCS, vol.\u00a02629, pp. 34\u201348. Springer, Heidelberg (2003)"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/10721975_17","volume-title":"Rewriting Techniques and Applications","author":"T. Takai","year":"2000","unstructured":"Takai, T., Kaji, Y., Seki, H.: Right-linear finite-path overlapping term rewriting systems effectively preserve recognizability. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol.\u00a01833. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11805618_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:12:43Z","timestamp":1605625963000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11805618_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540368342","9783540368359"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11805618_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}