Reachability analysis over term rewriting systems

Journal of Automated Reasoning

Volumn 33, Issue 3-4, 2004, Pages 341-383

  Feuillade, Guillaume ^a,b   Genet, Thomas ^a,b   Tong, Valérie Viet Triem ^a,b  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b CAMPUS DE BEAULIEU   (France)

Author keywords

Completion algorithm; Reachability analysis; Term rewriting; Timbuk; Tree automaton

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL LINGUISTICS; CRYPTOGRAPHY; FUNCTIONS; MATHEMATICAL MODELS; OPTIMIZATION; THEOREM PROVING; TREES (MATHEMATICS);

COMPLETION ALGORITHMS; REACHABILITY ANALYSIS; TERM REWRITING; TIMBUK TOOL; TREE AUTOMATION;

AUTOMATA THEORY;

EID: 15544365037     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10817-004-6246-0     Document Type: Review

References (32)

1. Baader, F. and Nipkow, T. (1998) Term Rewriting and All That, Cambridge University Press.
2. Borovanský, P., Kirchner, C., Kirchner, H., Moreau, P.-E. and Ringeissen, C. (1998) An overview of ELAN, in Proc. 2nd WRLA, Pont-à-mousson (France), Elsevier.
3. Brainerd, W. S. (1969) Tree generating regular systems, Inform, and Control 14, 217-231.
4. Comon, H. (1986) Sufficient completeness, term rewriting system and anti-unification, in J. Siekmann (ed.), Proc. 8th CADE Conf., Oxford (UK), LNCS 230, Springer-Verlag, pp. 128-140.
5. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S. and Tommasi, M. (2002) Tree automata techniques and applications, http://www.grappa.univ-lille3.fr/tata/.
6. Coquidé, J., Dauchet, M., Gilleron, R. and Vagvölgyi, S. (1991) Bottom-up tree pushdown automata and rewrite systems, in R. V. Book (ed.), Proc. 4th RTA Conf., Como (Italy), LNCS 488, Springer-Verlag, pp. 287-298.
7. Dauchet, M. and Tison, S. (1990) The theory of ground rewrite systems is decidable, in Proc. 5th LICS Symp., Philadelphia, PA, pp. 242-248.
8. Dershowitz, N. and Jouannaud, J.-P. (1990) Handbook of Theoretical Computer Science, Vol. B, Elsevier Science Publishers B. V. (North-Holland), Chapt. 6: Rewrite systems, pp. 244-320. Also as: Research report 478, LRI.
9. Dershowitz, N., Okada, M. and Sivakumar, G. (1988) Canonical conditional rewrite systems, in Proc. 9th CADE Conf., Argonne, IL, LNCS 310, Springer-Verlag.
10. Feuillade, G. and Genet, T. (2003) Reachability in conditional term rewriting systems, in FTP'2003, International Workshop on First-Order Theorem Proving, ENTCS 86(1), Elsevier.
11. Genet, T. (1997) Decidable approximations of sets of descendants and sets of normal forms (extended version), Technical Report RR-3325, INRIA.
12. Genet, T. (1998) Decidable approximations of sets of descendants and sets of normal forms, in Proc. 9th RTA Conf., Tsukuba (Japan), LNCS 1379, Springer-Verlag, pp. 151-165.
13. Genet, T. and Klay, F. (2000) Rewriting for cryptographic protocol verification, in Proc. 17th CADE Conf., Pittsburgh, PA, LNAI 1831, Springer-Verlag.
14. Genet, T., Tang-Talpin, Y.-M. and Viet Triem Tong, V. (2003) Verification of copy protection cryptographic protocol using approximations of term rewriting systems, in Proceedings of Workshop on Issues in the Theory of Security.
15. Genet, T. and Viet Triem Tong, V. (2000) Timbuk 2.0 - A tree automata library, IRISA/Université de Rennesl, http://vww.irisa.fr/lande/genet/timbuk/.
16. Genet, T. and Viet Triem Tong, V. (2001) Reachability analysis of term rewriting systems with Timbuk, in Proc. 8th LPAR Conf., Havana (Cuba), LNAI 2250, Springer-Verlag, pp. 691-702.
17. Gilleron, R. and Tison, S. (1995) Regular tree languages and rewrite systems, Fund. Inform. 24, 157-175.
18. Gyenizse, P. and Vagvölgyi, S. (1998) Linear generalized semi-monadic rewrite systems effectively preserve recognizability, TCS 194(1-2), 87-122.
19. Jacquemard, F. (1996) Decidable approximations of term rewriting systems, in H. Ganzinger (ed.), Proc. 7th RTA Conf., New Brunswick, NJ, Springer-Verlag, pp. 362-376.
20. Kapur, D., Narendran, P. and Zhang, H. (1987) On sufficient completeness and related properties of term rewriting systems, Acta Informatica 24, 395-415.
21. Knuth, D. E. and Bendix, P. B. (1970) Simple word problems in universal algebras, in J. Leech (ed.), Computational Problems in Abstract Algebra, Pergamon Press, Oxford, pp. 263-297.
22. Kounalis, E. (1985) Completeness in data type specifications, in B. Buchberger (ed.), Proceedings EUROCAL Conference, Linz (Austria), LNCS 204, Springer-Verlag, pp. 348-362.
23. Leroy, X., Doligez, D., Garrigue, J., Rémy, D. and Vouillon, J. (2000) The objective Caml system release 3.00 - Documentation and user's manual, INRIA, http://caml.inria.fr/ocaml/htmlman/.
24. Nipkow, T., Paulson, L. C. and Wenzel, M. (2002) Isabelle/HOL - A Proof Assistant for Higher-Order Logic, LNCS 2283, Springer.
25. Nipkow, T. and Weikum, G. (1983) A decidability result about sufficient completeness of axiomatically specified abstract data types, in 6th GI Conference, LNCS 145, Springer-Verlag, pp. 257-268.
26. Oehl, F. and Sinclair, D. (2001) Combining two approaches for the formal verification of cryptographic protocols, in Proceedings of ICLP Workshop on Specification, Analysis and Validation for Emerging Technologies in Computational Logic.
27. Paulson, L. (1997) Proving properties of security protocols by induction, in 10th Computer Security Foundations Workshop, IEEE Computer Society Press.
28. Réty, P. (1999) Regular sets of descendants for constructor-based rewrite systems, in Proc. 6th LPAR Conf., Tbilisi (Georgia), LNAI 1705, Springer-Verlag.
29. Réty, P. and Vuotto, J. (2002) Regular sets of descendants by some rewrite strategies, in Proc. 13th RTA Conf., Copenhagen (Denmark), LNCS 2378, Springer-Verlag.
30. Salomaa, K. (1988) Deterministic tree pushdown automata and monadic tree rewriting systems, J. Comput. System Sci. 37, 367-394.
31. Seki, H., Takai, T., Fujinaka, Y. and Kaji, Y. (2002) Layered transducing term rewriting system and its recognizability preserving property, in Proc. 13th RTA Conf., Copenhagen (Denmark), LNCS 2378, Springer-Verlag.
32. Takai, T., Kaji, Y. and Seki, H. (2000) Right-linear finite-path overlapping term rewriting systems effectively preserve recognizability, in Proc. 11th RTA Conf., Norwich (UK), LNCS 1833, Springer-Verlag.