Feasible trace reconstruction for Rewriting approximations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4098 LNCS, Issue , 2006, Pages 123-135

  Boichut, Yohan ^a,b   Genet, Thomas ^c,d  

^a UNIVERSITÉ DE FRANCHE COMTÉ   (France)

^b INRIA   (France)

^c UNIVERSITÉ DE RENNES 1   (France)

^d Amis du centre Jean Rostand Pouydesseaux   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; AUTOMATA THEORY; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SYSTEMS; MATHEMATICAL MODELS; TREES (MATHEMATICS);

MODELING LANGUAGES; REWRITING MODELS; TERM REWRITING SYSTEMS; TREE AUTOMATON COMPLETION TECHNIQUES;

ARTIFICIAL INTELLIGENCE;

EID: 33749381421     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11805618_10     Document Type: Conference Paper

References (19)

1. +05] A. Armando, D. Basin, Y. Boichut, Y. Chevalier, L. Compagna, J. Cuellar, P. Hankes Drielsma, P.-C. Héam, O. Kouchnarenko, J. Mantovani, S. Mödersheim, D. von Oheimb, M. Rusinowitch, J. Santos Santiago, M. Turuani, L. Viganò, and L. Vigneron. The AVISPA Tool for the automated validation of internet security protocols and applications. In CAV'2005, volume 3576 of LNCS, pages 281-285, Edinburgh, Scotland, 2005. Springer.
2. [BG06] Y. Boichut and Th. Genet. Trace reconstruction. Research Report RR2006-02, LIFC - Laboratoire d'Informatique de l'Université de Franche Comtéand IRISA / Université de Rennes, 2006. http://lifc.univ- fcomte.fr/publis/papers/Year/2006.html.
3. [BHK05] Y. Boichut, P.-C. Héam, and O. Kouchnarenko. Automatic Verification of Security Protocols Using Approximations. Research Report RR-5727, INRIA-Lorraine - CASSIS Project, October 2005.
4. +98] P. Borovanský, C. Kirchner, H. Kirchner, P.-E. Moreau, and C. Ringeissen. An overview of elan. In Proc. 2nd WRLA, ENTCS, Pont-à-mousson (France), 1998. Elsevier.
5. [BN98] F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
6. +01] Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, and José F. Quesada. Maude: Specification and programming in rewriting logic. Theoretical Computer Science, 2001.
7. +02] H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. http://www.grappa.univ-lille3.fr/tata/, 2002.
8. [FGVTT04] G. Feuillade, T. Genet, and V. Viet Triem Tong. Reachability Analysis over Term Rewriting Systems. JAR, 33 (3-4):341-383, 2004.
9. [Gen98] T. Genet. Decidable approximations of sets of descendants and sets of normal forms. In Proc. 9th RTA Conf., Tsukuba (Japan), volume 1379 of LNCS, pages 151-165. Springer-Verlag, 1998.
10. [GHLS03] J.-M. Gaillourdet, Th. Hillenbrand, B. Löchner, and H. Spies. The new WALOMEISTER loop at work. In F. Baader, editor, Proc. CADE'2003, volume 2741 of LNAI, pages 317-321. Springer-Verlag, 2003.
11. [GK00] T. Genet and F. Klay. Rewriting for Cryptographic Protocol Verification. In In Proc. CADE'2000, volume 1831 of LNAI. Springer-Verlag, 2000.
12. [GTTVTT03] T. Genet, Y.-M. Tang-Talpin, and V. Viet Triem Tong. Verification of Copy Protection Cryptographic Protocol using Approximations of Term Rewriting Systems. In In Proc. of WITS'2003, 2003.
13. [GV98] P. Gyenizse and S. Vágvölgyi. Linear Generalized Semi-Monadic Rewrite Systems Effectively Preserve Recognizability. TCS, 194(1-2):87-122, 1998.
14. [GVTT00] T. Genet and V. Viet Triem Tong. Timbuk 2.0 - a Tree Automata Library. IRISA / Université de Rennes 1, 2000. http://www.irisa.fr/lande/ genet/timbuk/.
15. [GVTT01] T. Genet and Valérie Viet Triem Tong. Reachability Analysis of Term Rewriting Systems with timbuk. In Proc. 8th LPAR Conf., Havana (Cuba), volume 2250 of LNAI, pages 691-702. Springer-Verlag, 2001.
16. [Jac96] F. Jacquemard. Decidable approximations of term rewriting systems. In H. Ganzinger, editor, Proc. 7th RTA Conf., New Brunswick (New Jersey, USA), pages 362-376. Springer-Verlag, 1996.
17. [Mon99] D. Monniaux. Abstracting Cryptographic Protocols with Tree Automata. In Proc. 6th SAS, Venezia (Italy), 1999.
18. [OCKS03] F. Oehl, G. Cécé, O. Kouchnarenko, and D. Sinclair. Automatic Approximation for the Verification of Cryptographic Protocols. In In Proceedings of FASE'03, volume 2629 of LNCS, pages 34-48. Springer-Verlag, 2003.
19. [TKS00] T. Takai, Y. Kaji, and H. Seki. Right-linear finite-path overlapping term rewriting systems effectively preserve recognizability. In Proc. 11th RTA Conf., Norwich (UK), volume 1833 of LNCS. Springer-Verlag, 2000.