SAT solving for termination analysis with polynomial interpretations

Authors:
Carsten Fuhs;Jürgen Giesl;Aart Middeldorp;Peter Schneider-Kamp;René Thiemann;Harald Zankl
Affiliations:
LuFG Informatik 2, RWTH Aachen, Germany;LuFG Informatik 2, RWTH Aachen, Germany;Institute of Computer Science, University of Innsbruck, Austria;LuFG Informatik 2, RWTH Aachen, Germany;LuFG Informatik 2, RWTH Aachen, Germany;Institute of Computer Science, University of Innsbruck, Austria
Venue:
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Year:
2007

Citing 14
Cited 42

Term rewriting and all that

Term rewriting and all that
Termination of term rewriting using dependency pairs

Theoretical Computer Science - Trees in algebra and programming
Testing Positiveness of Polynomials

Journal of Automated Reasoning
Mechanically Proving Termination Using Polynomial Interpretations

Journal of Automated Reasoning
Mechanizing and Improving Dependency Pairs

Journal of Automated Reasoning
Tyrolean termination tool: Techniques and features

Information and Computation
Automating the dependency pair method

Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Automated termination analysis for logic programs by term rewriting

LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
SAT solving for argument filterings

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
AProVE 1.2: automatic termination proofs in the dependency pair framework

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Matrix interpretations for proving termination of term rewriting

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Solving partial order constraints for LPO termination

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Automated termination analysis for Haskell: from term rewriting to programming languages

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Termination of string rewriting with matrix interpretations

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications

Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers

Electronic Notes in Theoretical Computer Science (ENTCS)
Proving Termination by Bounded Increase

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Proving Termination Using Recursive Path Orders and SAT Solving

FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Maximal Termination

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Usable Rules for Context-Sensitive Rewrite Systems

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Proving Quadratic Derivational Complexities Using Context Dependent Interpretations

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Root-Labeling

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Search Techniques for Rational Polynomial Orders

Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Increasing Interpretations

Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Automated Implicit Computational Complexity Analysis (System Description)

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Automated Complexity Analysis Based on the Dependency Pair Method

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Complexity, Graphs, and the Dependency Pair Method

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Proving Termination with (Boolean) Satisfaction

Logic-Based Program Synthesis and Transformation
Termination Analysis of Logic Programs Based on Dependency Graphs

Logic-Based Program Synthesis and Transformation
KBO Orientability

Journal of Automated Reasoning
Proving Termination of Integer Term Rewriting

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Dependency Pairs and Polynomial Path Orders

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Termination Analysis by Dependency Pairs and Inductive Theorem Proving

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Increasing interpretations

Annals of Mathematics and Artificial Intelligence
Improved Matrix Interpretation

SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
A3PAT, an approach for certified automated termination proofs

Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Satisfying KBO constraints

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Cdiprover3: a tool for proving derivational complexities of term rewriting systems

ESSLLI'08/09 Proceedings of the 2008 international conference on Interfaces: explorations in logic, language and computation
Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem

Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Lazy abstraction for size-change termination

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Improving resource-unaware SAT solvers

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Satisfiability of non-linear (Ir)rational arithmetic

LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Polytool: Polynomial interpretations as a basis for termination analysis of logic programs

Theory and Practice of Logic Programming
Empirical study of the anatomy of modern sat solvers

SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Proving Termination by Dependency Pairs and Inductive Theorem Proving

Journal of Automated Reasoning
Harnessing first order termination provers using higher order dependency pairs

FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
SAT Modulo Linear Arithmetic for Solving Polynomial Constraints

Journal of Automated Reasoning
Synthesizing shortest linear straight-line programs over GF(2) using SAT

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Monotonicity criteria for polynomial interpretations over the naturals

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs

Journal of Automated Reasoning
Designing scalable parallel SAT solvers

SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Solving non-linear arithmetic

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Synthesis of sup-interpretations: A survey

Theoretical Computer Science
Unifying the Knuth-Bendix, recursive path and polynomial orders

Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.