Proving Termination of Integer Term Rewriting

Authors:
Carsten Fuhs;Jürgen Giesl;Martin Plücker;Peter Schneider-Kamp;Stephan Falke
Affiliations:
LuFG Informatik 2, RWTH Aachen University, Germany;LuFG Informatik 2, RWTH Aachen University, Germany;LuFG Informatik 2, RWTH Aachen University, Germany;Dept. of Mathematics & CS, University of Southern Denmark, Odense, Denmark;CS Department, University of New Mexico, Albuquerque, USA
Venue:
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Year:
2009

Citing 24
Cited 10

Termination of term rewriting using dependency pairs

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

Journal of Automated Reasoning
Modular termination proofs for rewriting using dependency pairs

Journal of Symbolic Computation
Synthesis of Linear Ranking Functions

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Practical Methods for Proving Program Termination

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Inference of termination conditions for numerical loops in Prolog

Theory and Practice of Logic Programming
Transition Invariants

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Termination proofs for systems code

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Mechanizing and Improving Dependency Pairs

Journal of Automated Reasoning
Tyrolean termination tool: Techniques and features

Information and Computation
Proving Termination by Bounded Increase

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
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
Constraint-Based Approach for Analysis of Hybrid Systems

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Tyrolean Termination Tool 2

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Automated termination proofs for logic programs by term rewriting

ACM Transactions on Computational Logic (TOCL)
Automating the dependency pair method

Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
SAT solving for termination analysis with polynomial interpretations

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Ranking abstractions

ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
Termination of polynomial programs

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
AProVE 1.2: automatic termination proofs in the dependency pair framework

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Linear ranking with reachability

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Abstraction refinement for termination

SAS'05 Proceedings of the 12th international conference on Static Analysis
Automated termination analysis for Haskell: from term rewriting to programming languages

RTA'06 Proceedings of the 17th international conference on Term Rewriting 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
Automated termination proofs for haskell by term rewriting

ACM Transactions on Programming Languages and Systems (TOPLAS)
Termination graphs for Java bytecode

Verification, induction termination analysis
Termination graphs for Java bytecode

Verification, induction termination analysis
On proving termination of constrained term rewrite systems by eliminating edges from dependency graphs

WFLP'11 Proceedings of the 20th international conference on Functional and constraint logic programming
Termination of context-sensitive rewriting with built-in numbers and collection data structures

WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
Correctness of program transformations as a termination problem

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Automated termination proofs for Java programs with cyclic data

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
The COST IC0701 verification competition 2011

FoVeOOS'11 Proceedings of the 2011 international conference on Formal Verification of Object-Oriented Software
Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs

Proceedings of the 14th symposium on Principles and practice of declarative programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

When using rewrite techniques for termination analysis of programs, a main problem are pre-defined data types like integers. We extend term rewriting by built-in integers and adapt the dependency pair framework to prove termination of integer term rewriting automatically.