Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering

Takahito Aoto 2013 Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering Proc. FroCoS LNCS 8152 Springer 311–326 10.1007/978-3-642-40885-4_22 Thomas Arts Jürgen Giesl 2000 Termination of Term Rewriting using Dependency Pairs Theoretical Computer Science 236 \voidb@x 1-2 133–178 10.1016/S0304-3975(99)00207-8 Martin Avanzini Georg Moser 2013 Tyrolean Complexity Tool: Features and Usage Proc. RTA LIPIcs 21 Dagstuhl 71–80 10.4230/LIPIcs.RTA.2013.71 Frédéric Blanqui Adam Koprowski 2011 CoLoR: a Coq library on well-founded rewrite relations and its application on the automated verification of termination certificates Mathematical Structures in Computer Science 21 4 827–859 10.1017/S0960129511000120 Michael Codish Carsten Fuhs Jürgen Giesl Peter Schneider-Kamp 2010 Lazy Abstraction for Size-Change Termination Proc. LPAR LNCS 6397 Springer 217–232 10.1007/978-3-642-16242-8_16 Évelyne Contejean Pierre Courtieu Julien Forest Olivier Pons Xavier Urbain 2011 Automated Certified Proofs with C-0.1exiME3 Proc. RTA LIPIcs 10 Dagstuhl 21–30 10.4230/LIPIcs.RTA.2011.21 Nachum Dershowitz 1987 Termination of Rewriting Journal of Symbolic Computation 3 \voidb@x 1-2 69–116 10.1016/S0747-7171(87)80022-6 Fabian Emmes Tim Enger Jürgen Giesl 2012 Proving Non-Looping Non-Termination Automatically Proc. IJCAR LNCS 7364 Springer 225–240 10.1007/978-3-642-31365-3_19 Jörg Endrullis Johannes Waldmann Hans Zantema 2008 Matrix Interpretations for Proving Termination of Term Rewriting Journal of Automated Reasoning 40 \voidb@x 2-3 195–220 10.1007/s10817-007-9087-9 Bertram Felgenhauer René Thiemann 2014 Reachability Analysis with State-Compatible Automata Proc. LATA LNCS 8370 Springer 347–359 10.1007/978-3-319-04921-2_28 Alfons Geser Dieter Hofbauer Johannes Waldmann Hans Zantema 2007 On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems Information and Computation 205 4 512–534 10.1007/978-3-540-32033-3_26 Jürgen Giesl Marc Brockschmidt Fabian Emmes Florian Frohn Carsten Fuhs Carsten Otto Martin Plücker Peter Schneider-Kamp Thomas Ströder Steffi Swiderski René Thiemann 2014 Proving Termination of Programs Automatically with AProVE Proc. IJCAR LNAI 8562 Springer 184–191 10.1007/978-3-319-08587-6_13 Jürgen Giesl René Thiemann Peter Schneider-Kamp Stephan Falke 2006 Mechanizing and Improving Dependency Pairs Journal of Automated Reasoning 37 3 155–203 10.1007/s10817-006-9057-7 Bernhard Gramlich 1995 Abstract Relations between Restricted Termination and Confluence Properties of Rewrite Systems Fundamenta Informaticae 24 \voidb@x 1-2 3–23 10.3233/FI-1995-24121 Nao Hirokawa Aart Middeldorp 2007 Tyrolean Termination Tool: Techniques and Features Information and Computation 205 4 474–511 10.1016/j.ic.2006.08.010 Nao Hirokawa Aart Middeldorp Harald Zankl 2013 Uncurrying for Termination and Complexity Journal of Automated Reasoning 50 3 279–315 10.1007/s10817-012-9248-3 Donald E. Knuth Peter B. Bendix 1970 Simple Word Problems in Universal Algebras Computational Problems in Abstract Algebra 263–297 10.1016/B978-0-08-012975-4.50028-X Adam Koprowski Johannes Waldmann 2008 Arctic Terminationłdots Below Zero Proc. RTA LNCS 5117 Springer 202–216 10.1007/978-3-540-70590-1_14 Martin Korp Christian Sternagel Harald Zankl Aart Middeldorp 2009 Tyrolean Termination Tool 2 Proc. RTA LNCS 5595 Springer 295–304 10.1007/978-3-642-02348-4_21 Dallas Lankford 1979 On Proving Term Rewriting Systems are Noetherian Technical Report MTP-3 Louisiana Technical University

Ruston, LA, USA

Chin Soon Lee Neil D. Jones Amir M. Ben-Amram 2001 The Size-Change Principle for Program Termination Proc. POPL ACM New York, NY, USA 81–92 10.1145/373243.360210 Salvador Lucas 2005 Polynomials over the reals in proofs of termination: From theory to practice RAIRO – Theoretical Informatics and Applications 39 3 547–586 10.1051/ita:2005029 Christian Sternagel Aart Middeldorp 2008 Root-Labeling Proc. RTA LNCS 5117 Springer 336–350 10.1007/978-3-540-70590-1_23 Christian Sternagel René Thiemann 2011 Generalized and Formalized Uncurrying Proc. FroCoS LNAI 6989 Springer 243–258 10.1007/978-3-642-24364-6_17 Thomas Sternagel Harald Zankl 2012 KBCV – Knuth-Bendix Completion Visualizer Proc. IJCAR LNCS 7364 Springer 530–536 10.1007/978-3-642-31365-3_41 René Thiemann Jürgen Giesl 2005 The size-change principle and dependency pairs for termination of term rewriting Applicable Algebra in Engineering, Communication and Computing 16 4 229–270 10.1007/s00200-005-0179-7 René Thiemann Christian Sternagel 2009 Certification of Termination Proofs using C-0.2exe-0.5exT-0.5exA Proc. TPHOLs LNCS 5674 Springer 452–468 10.1007/978-3-642-03359-9_31 Xavier Urbain 2001 Automated incremental termination proofs for hierarchically defined term rewriting systems Proc. IJCAR LNAI 2083 Springer 485–498 10.1007/3-540-45744-5_42 Johannes Waldmann 2004 Matchbox: A Tool for Match-Bounded String Rewriting Proc. RTA LNCS 3091 Springer 85–94 10.1007/978-3-540-25979-4_6 Sarah Winkler Haruhiko Sato Aart Middeldorp Masahito Kurihara 2013 Multi-Completion with Termination Tools Journal of Automated Reasoning 50 3 317–354 10.1007/s10817-012-9249-2 Harald Zankl Bertram Felgenhauer Aart Middeldorp 2011 CSI – A Confluence Tool Proc. CADE LNAI 6803 Springer 499–505 10.1007/978-3-642-22438-6_38 Harald Zankl Martin Korp 2014 Modular Complexity Analysis for Term Rewriting Logical Methods in Computer Science 10 \voidb@x 1:19 1–33 10.2168/LMCS-10(1:19)2014 Hans Zantema 1995 Termination of Term Rewriting by Semantic Labelling Fundamenta Informaticae 24 \voidb@x 1-2 89–105 10.3233/FI-1995-24124