On automating inductive and non-inductive termination methods

DOI10.1007/3-540-46674-6_16MaRDI QIDQ4501582zbMATH OpenFDO

Authors Fairouz Kamareddine, F. Monin

Publication date 4 September 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46674-6_16

zbMATH Keywords

automated termination of a recursive function

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 107881
• AN EXTENSION OF AN AUTOMATED TERMINATION METHOD OF RECURSIVE FUNCTIONS
• Automatizing termination proofs of recursively defined functions
• Logic for Programming, Artificial Intelligence, and Reasoning
• Decision Procedures for Automating Termination Proofs
• A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
• scientific article; zbMATH DE number 1389654
• scientific article; zbMATH DE number 3880144
• Automated termination analysis for programs with second-order recursion

Cited in

(4)

• AN EXTENSION OF AN AUTOMATED TERMINATION METHOD OF RECURSIVE FUNCTIONS
• On formalised proofs of termination of recursive functions
• On automating the extraction of programs from proofs using product types
• An ordinal measure based procedure for termination of functions

Describes a project that uses

Uses Software

• Coq

This page was built for publication: On automating inductive and non-inductive termination methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501582)