Skip to main content
SpringerLink
Log in

Proving Confluence of Term Rewriting Systems Automatically

  • Conference paper
Rewriting Techniques and Applications (RTA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5595))

Included in the following conference series:

Abstract

We have developed an automated confluence prover for term rewriting systems (TRSs). This paper presents theoretical and technical ingredients that have been used in our prover. A distinctive feature of our prover is incorporation of several divide–and–conquer criteria such as those for commutative (Toyama, 1988), layer-preserving (Ohlebusch, 1994) and persistent (Aoto & Toyama, 1997) combinations. For a TRS to which direct confluence criteria do not apply, the prover decomposes it into components and tries to apply direct confluence criteria to each component. Then the prover combines these results to infer the (non-)confluence of the whole system. To the best of our knowledge, an automated confluence prover based on such an approach has been unknown.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aoto, T., Toyama, Y.: On composable properties of term rewriting systems. In: Hanus, M., Heering, J., Meinke, K. (eds.) ALP 1997 and HOA 1997. LNCS, vol. 1298, pp. 114–128. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  2. Aoto, T., Toyama, Y.: Persistency of confluence. Journal of Universal Computer Science 3(11), 1134–1147 (1997)

    MathSciNet  MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

  4. Giesl, J., Thiemann, R., Schneider-Kamp, P.: Mechanizing and improving dependency pairs. Journal of Automated Reasoning 37(3), 155–203 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  5. Godoy, G., Tiwari, A.: Confluence of shallow right-linear rewrite systems. In: Ong, L. (ed.) CSL 2005. LNCS, vol. 3634, pp. 541–556. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Gramlich, B.: Abstract relations between restricted termination and confluence property of rewrite systems. Fundamenta Informaticae 24, 3–23 (1995)

    MathSciNet  MATH  Google Scholar 

  7. Huet, G.: Confluent reductions: abstract properties and applications to term rewriting systems. Journal of the ACM 27(4), 797–821 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  8. Knuth, D.E., Bendix, P.B.: Simple word problems in universal algebras. In: Leech, J. (ed.) Computational Problems in Abstract Algebra, pp. 263–297. Pergamon Press (1970)

    Google Scholar 

  9. Ohlebusch, E.: Modular Properties of Composable Term Rewriting Systems. PhD thesis, Universität Bielefeld (1994)

    Google Scholar 

  10. Ohlebusch, E.: Advanced Topics in Term Rewriting Systems. Springer, Heidelberg (2002)

    Book  MATH  Google Scholar 

  11. Okui, S.: Simultaneous critical pairs and Church-Rosser property. In: Nipkow, T. (ed.) RTA 1998. LNCS, vol. 1379, pp. 2–16. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  12. Oyamaguchi, M., Ohta, Y.: A new parallel closed condition for Church-Rosser of left-linear TRS’s. In: Comon, H. (ed.) RTA 1997. LNCS, vol. 1232, pp. 187–201. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  13. Rosen, B.K.: Tree-manipulating systems and Church-Rosser theorems. Journal of the ACM 20, 160–187 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  14. Tiwari, A.: Deciding confluence of certain term rewriting systems in polynomial time. In: Proc. of LICS 2002, pp. 447–458. IEEE Computer Society Press, Los Alamitos (2002)

    Google Scholar 

  15. Toyama, Y.: On the Church-Rosser property for the direct sum of term rewriting systems. Journal of the ACM 34(1), 128–143 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  16. Toyama, Y.: Commutativity of term rewriting systems. In: Fuchi, K., Kott, L. (eds.) Programming of Future Generation Computers II, pp. 393–407. North-Holland, Amsterdam (1988)

    Google Scholar 

  17. Toyama, Y.: Confluent term rewriting systems (invited talk). In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, p. 1. Springer, Heidelberg (2005), http://www.nue.riec.tohoku.ac.jp/user/toyama/slides/toyama-RTA05.pdf

    Chapter  Google Scholar 

  18. Toyama, Y., Oyamaguchi, M.: Conditional linearization of non-duplicating term rewriting systems. IEICE Trans. Information and Systems E84-D(5), 439–447 (2001)

    Google Scholar 

  19. van Oostrom, V.: Confluence by decreasing diagrams. Theoretical Computer Science 126(2), 259–280 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  20. van Oostrom, V.: Developing developments. Theoretical Computer Science 175(1), 159–181 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  21. van Oostrom, V.: Confluence by decreasing diagrams: converted. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol. 5117, pp. 306–320. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  22. Yoshida, J., Aoto, T., Toyama, Y.: Automating confluence check of term rewriting systems. Computer Software (to appear ) (in Japanese)

    Google Scholar 

  23. Zantema, H.: Termination of term rewriting: interpretation and type elimination. Journal of Symbolic Computation 17, 23–50 (1994)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. RIEC, Tohoku University, Japan

    Takahito Aoto, Junichi Yoshida & Yoshihito Toyama

Authors
  1. Takahito Aoto
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Junichi Yoshida
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yoshihito Toyama
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratoire PPS, Université Paris Diderot - Paris 7, CNRS, Paris, France

    Ralf Treinen

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aoto, T., Yoshida, J., Toyama, Y. (2009). Proving Confluence of Term Rewriting Systems Automatically. In: Treinen, R. (eds) Rewriting Techniques and Applications. RTA 2009. Lecture Notes in Computer Science, vol 5595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02348-4_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02348-4_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02347-7

  • Online ISBN: 978-3-642-02348-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation