CSI: a confluence tool

Authors:
Harald Zankl;Bertram Felgenhauer;Aart Middeldorp
Affiliations:
Institute of Computer Science, University of Innsbruck, Innsbruck, Austria;Institute of Computer Science, University of Innsbruck, Innsbruck, Austria;Institute of Computer Science, University of Innsbruck, Innsbruck, Austria
Venue:
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Year:
2011

Citing 11
Cited 1

Confluence by decreasing diagrams

Theoretical Computer Science
Developing developments

NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
Term rewriting and all that

Term rewriting and all that
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

Journal of the ACM (JACM)
Deciding Confluence of Certain Term Rewriting Systems in Polynomial Time

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Decidable Approximations of Sets of Descendants and Sets of Normal Forms

RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Confluence by Decreasing Diagrams

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Proving Confluence of Term Rewriting Systems Automatically

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Tyrolean Termination Tool 2

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Match-bounds revisited

Information and Computation
Proving and disproving termination of higher-order functions

FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems

Confluence of non-left-linear TRSs via relative termination

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.