Proving Non-looping Non-termination Automatically

We introduce a technique to prove non-termination of term rewrite systems automatically. Our technique improves over previous approaches substantially, as it can also detect non-looping non-termination.

[1]  Johannes Waldmann.  Matchbox: A Tool for Match-Bounded String Rewriting , 2004, RTA.

[2]  Dieter Hofbauer,et al.  Finding and Certifying Loops , 2009, SOFSEM.

[3]  Jürgen Giesl,et al.  Automated Detection of Non-termination and NullPointerExceptions for Java Bytecode , 2011, FoVeOOS.

[4]  Hans Zantema.  Termination of String Rewriting Proved Automatically , 2005, Journal of Automated Reasoning.

[5]  Larry Wos,et al.  What Is Automated Reasoning? , 1987, J. Autom. Reason..

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

[7]  Jürgen Giesl,et al.  Mechanizing and Improving Dependency Pairs , 2006, Journal of Automated Reasoning.

[8]  Étienne Payet,et al.  Loop detection in term rewriting using the eliminating unfoldings , 2008, Theor. Comput. Sci..

[9]  Yi Wang,et al.  On Non-looping Term Rewriting , 2006 .

[10]  Bernhard Gramlich,et al.  VMTL-A Modular Termination Laboratory , 2009, RTA.

[11]  Nao Hirokawa,et al.  Automating the Dependency Pair Method , 2005, CADE.

[12]  Jürgen Giesl,et al.  Automatic Termination Proofs in the Dependency Pair Framework , 2006, IJCAR.

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

[14]  Bernhard Rumpe,et al.  SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 23-29, 2010. Proceedings , 2010, SOFSEM.

[15]  Hans Zantema,et al.  Non-looping string rewriting , 1999, RAIRO Theor. Informatics Appl..

[16]  Dieter Hofbauer,et al.  Termination Proofs for String Rewriting Systems via Inverse Match-Bounds , 2005, Journal of Automated Reasoning.