Skip to main content
SpringerLink
Log in

Reachability Analysis over Term Rewriting Systems

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

This paper surveys some techniques and tools for achieving reachability analysis over term rewriting systems. The core of those techniques is a generic tree automata completion algorithm used to compute in an exact or approximated way the set of descendants (or reachable terms). This algorithm has been implemented in the \textsf{Timbuk} tool. Furthermore, we show that many classes with regular sets of descendants of the literature corresponds to specific instances of the tree automata completion algorithm and can thus be efficiently computed by \textsf{Timbuk} . An extension of the completion algorithm to conditional term rewriting systems and some applications are also presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Baader, F. and Nipkow, T. (1998) Term Rewriting and All That, Cambridge University Press.

  • Borovanský, P., Kirchner, C., Kirchner, H., Moreau, P.-E. and Ringeissen, C. (1998) An overview of \textsf{ELAN} , in Proc. 2nd WRLA, Pont-à-mousson (France), Elsevier.

  • Brainerd, W. S. (1969) Tree generating regular systems, Inform. and Control 14, 217–231.

    Google Scholar 

  • 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.

  • 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/.

  • Coquidé, J., Dauchet, M., Gilleron, R. and Vágvö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.

  • Dauchet, M. and Tison, S. (1990) The theory of ground rewrite systems is decidable, in Proc. 5th LICS Symp., Philadelphia, PA, pp. 242–248.

  • 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.

  • Dershowitz, N., Okada, M. and Sivakumar, G. (1988) Canonical conditional rewrite systems, in Proc. 9th CADE Conf., Argonne, IL, LNCS 310, Springer-Verlag.

  • 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.

  • Genet, T. (1997) Decidable approximations of sets of descendants and sets of normal forms (extended version), Technical Report RR-3325, INRIA.

  • 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.

  • Genet, T. and Klay, F. (2000) Rewriting for cryptographic protocol verification, in Proc. 17th CADE Conf., Pittsburgh, PA, LNAI 1831, Springer-Verlag.

  • 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.

  • Genet, T. and Viet Triem Tong, V. (2000) Timbuk 2.0 – A tree automata library, IRISA/Université de Rennes 1, http://www.irisa.fr/lande/genet/timbuk/.

  • 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.

  • Gilleron, R. and Tison, S. (1995) Regular tree languages and rewrite systems, Fund. Inform. 24, 157–175.

    Google Scholar 

  • Gyenizse, P. and Vágvölgyi, S. (1998) Linear generalized semi-monadic rewrite systems effectively preserve recognizability, TCS 194(1–2), 87–122.

    Google Scholar 

  • 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.

  • Kapur, D., Narendran, P. and Zhang, H. (1987) On sufficient completeness and related properties of term rewriting systems, Acta Informatica 24, 395–415.

    Google Scholar 

  • 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.

    Google Scholar 

  • Kounalis, E. (1985) Completeness in data type specifications, in B. Buchberger (ed.), Proceedings EUROCAL Conference, Linz (Austria), LNCS 204, Springer-Verlag, pp. 348–362.

  • 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/.

  • Nipkow, T., Paulson, L. C. and Wenzel, M. (2002) Isabelle/HOL – A Proof Assistant for Higher-Order Logic, LNCS 2283, Springer.

  • 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.

  • 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.

  • Paulson, L. (1997) Proving properties of security protocols by induction, in 10th Computer Security Foundations Workshop, IEEE Computer Society Press.

  • Réty, P. (1999) Regular sets of descendants for constructor-based rewrite systems, in Proc. 6th LPAR Conf., Tbilisi (Georgia), LNAI 1705, Springer-Verlag.

  • 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.

  • Salomaa, K. (1988) Deterministic tree pushdown automata and monadic tree rewriting systems, J. Comput. System Sci. 37, 367–394.

    Google Scholar 

  • 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.

  • 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.

Download references

Author information

Authors and Affiliations

  1. IRISA/ENS Cachan, Campus de Beaulieu, F-35042, Rennes Cedex, France

    Guillaume Feuillade

  2. IRISA/Université de Rennes 1, Campus de Beaulieu, F-35042, Rennes Cedex, France

    Thomas Genet & Valérie Viet Triem Tong

Authors
  1. Guillaume Feuillade
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Genet
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Valérie Viet Triem Tong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guillaume Feuillade.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Feuillade, G., Genet, T. & Viet Triem Tong, V. Reachability Analysis over Term Rewriting Systems. J Autom Reasoning 33, 341–383 (2004). https://doi.org/10.1007/s10817-004-6246-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10817-004-6246-0

Keywords

Search

Navigation