scientific article; zbMATH DE number 107881
From MaRDI portal
Publication:4023458
Recommendations
- Decision Procedures for Automating Termination Proofs
- Automata-Based Termination Proofs
- Automata-based termination proofs
- Automatizing termination proofs of recursively defined functions
- Modular and incremental automated termination proofs
- Automatic proofs of termination with elementary interpretations
- Certification of Automated Termination Proofs
- Automated termination proofs for logic programs by term rewriting
Cited in
(17)- On proving the termination of algorithms by machine
- Automatizing termination proofs of recursively defined functions
- AN EXTENSION OF AN AUTOMATED TERMINATION METHOD OF RECURSIVE FUNCTIONS
- Decision Procedures for Automating Termination Proofs
- scientific article; zbMATH DE number 4072437 (Why is no real title available?)
- scientific article; zbMATH DE number 1500561 (Why is no real title available?)
- scientific article; zbMATH DE number 1748590 (Why is no real title available?)
- Termination of theorem proving by reuse
- Termination of algorithms over non-freely generated data types
- scientific article; zbMATH DE number 1405455 (Why is no real title available?)
- Automated modular termination proofs for real Prolog programs
- Automatic termination proofs with transformation orderings
- A Transformational Approach to Prove Outermost Termination Automatically
- How to make ad hoc proof automation less ad hoc
- Formalizing bounded increase
- A higher-order interpretation of deductive tableau
- Improving automation for higher-order proof steps
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4023458)
