SAT Solving for Termination Analysis with Polynomial Interpretations

Polynomial interpretations are one of the most popular techniques for automated termination analysis and the search for such interpretations is a main bottleneck in most termination provers. We show that one can obtain speedups in orders of magnitude by encoding this task as a SAT problem and by applying modern SAT solvers.

[1]  Frank Wolter,et al.  Monodic fragments of first-order temporal logics: 2000-2001 A.D , 2001, LPAR.

[2]  Jürgen Giesl,et al.  Size-Change Termination for Term Rewriting , 2003, RTA.

[3]  J. Klop,et al.  WST ’ 04 7 th International Workshop on Termination , 2004 .

[4]  Jürgen Giesl,et al.  Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages , 2006, RTA.

[5]  Peter J. Stuckey,et al.  Solving Partial Order Constraints for LPO Termination , 2005, J. Satisf. Boolean Model. Comput..

[6]  Oliver Kullmann.  The SAT 2005 Solver Competition on Random Instances , 2006, J. Satisf. Boolean Model. Comput..

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

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

[9]  Jürgen Giesl,et al.  A SAT-based Implementation for RPO Termination ? , 2000 .

[10]  Mesut Gunes,et al.  From Simulations to Testbeds — Architecture of the Hybrid MCG-Mesh Testbed , 2006 .

[11]  Jürgen Giesl,et al.  The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs , 2005, LPAR.

[12]  Nao Hirokawa,et al.  Tyrolean termination tool: Techniques and features , 2007, Inf. Comput..

[13]  Hoon Hong,et al.  Testing Positiveness of Polynomials , 1998, Journal of Automated Reasoning.

[14]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[15]  Dieter Hofbauer,et al.  Termination of String Rewriting with Matrix Interpretations , 2006, RTA.

[16]  Benedikt Bollig,et al.  Automata and logics for message sequence charts , 2005 .

[17]  Claude Marché,et al.  Mechanically Proving Termination Using Polynomial Interpretations , 2005, Journal of Automated Reasoning.

[18]  Nao Hirokawa,et al.  Constraints for Argument Filterings , 2007, SOFSEM.

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

[20]  Jürgen Giesl,et al.  SAT Solving for Argument Filterings , 2006, LPAR.

[21]  Philip Wadler.  Call-by-Value Is Dual to Call-by-Name - Reloaded , 2005, RTA.

[22]  Felix C. Freiling,et al.  Revisiting Failure Detection and Consensus in Omission Failure Environments , 2005, ICTAC.

[23]  Jürgen Giesl,et al.  Termination of term rewriting using dependency pairs , 2000, Theor. Comput. Sci..

[24]  Karem A. Sakallah,et al.  Pueblo: A Hybrid Pseudo-Boolean SAT Solver , 2006, J. Satisf. Boolean Model. Comput..

[25]  Hans Zantema,et al.  Matrix Interpretations for Proving Termination of Term Rewriting , 2006, Journal of Automated Reasoning.

[26]  Aart Middeldorp,et al.  KBO as a Satisfaction Problem , 2006 .

[27]  Jürgen Giesl,et al.  Automated Termination Analysis for Logic Programs by Term Rewriting , 2006, LOPSTR.

[28]  Wiebe van der Hoek,et al.  SOFSEM 2007: Theory and Practice of Computer Science , 2007 .

[29]  G. S. Tseitin.  On the Complexity of Derivation in Propositional Calculus , 1983 .

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

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

[32]  Thierry Cachat.  The Power of One-Letter Rational Languages , 2001, Developments in Language Theory.