CSI - A Confluence Tool

This paper describes a new confluence tool for term rewrite systems. Due to its modular design, the few techniques implemented so far can be combined flexibly. Methods developed for termination analysis are adapted to prove and disprove confluence. Preliminary experimental results show the potential of our tool.

[1]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[2]  Gérard P. Huet,et al.  Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.

[3]  Aart Middeldorp,et al.  Tyrolean Termination Tool 2 , 2009, RTA.

[4]  Yoshihito Toyama,et al.  Proving Confluence of Term Rewriting Systems Automatically , 2009, RTA.

[5]  H. Brown,et al.  Computational Problems in Abstract Algebra , 1971 .

[6]  D. Knuth,et al.  Simple Word Problems in Universal Algebras , 1983 .

[7]  Pierre Courtieu,et al.  Automated Certified Proofs with CiME3 , 2011, RTA.

[8]  Takahito Aoto,et al.  Automated Confluence Proof by Decreasing Diagrams based on Rule-Labelling , 2010, RTA.

[9]  Terese.  Term rewriting systems , 2003, Cambridge tracts in theoretical computer science.

[10]  Ashish Tiwari.  Deciding confluence of certain term rewriting systems in polynomial time , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[11]  Thomas Genet,et al.  Decidable Approximations of Sets of Descendants and Sets of Normal Forms , 1998, RTA.

[12]  Bertram Felgenhauer,et al.  Layer Systems for Proving Confluence , 2011, FSTTCS.

[13]  Bertram Felgenhauer,et al.  Labelings for Decreasing Diagrams , 2011, RTA.

[14]  Jürgen Giesl,et al.  Proving and Disproving Termination of Higher-Order Functions , 2005, FroCoS.

[15]  Vincent van Oostrom,et al.  Confluence by Decreasing Diagrams , 1994, Theor. Comput. Sci..

[16]  Gerard Huet,et al.  Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[17]  Vincent van Oostrom,et al.  Developing Developments , 1997, Theor. Comput. Sci..

[18]  Aart Middeldorp,et al.  Match-bounds revisited , 2009, Inf. Comput..

[19]  Donald E. Knuth,et al.  Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research. , 1970 .