Automated termination analysis for programs with second-order recursion

DOI10.1007/978-3-642-12002-2_18MaRDI QIDQ3557079zbMATH OpenOpenAlexFDO

Authors Markus Aderhold

Publication date 27 April 2010

Published in Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-12002-2_18

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Nonnumerical algorithms (68W05)

Recommendations

• Automated synthesis of induction axioms for programs with second-order recursion
• scientific article; zbMATH DE number 4072437
• Termination analysis for functional programs
• Termination analysis for partial functions
• Termination of nested and mutually recursive algorithms

Cited in

(5)

• Automatic termination analysis for functional and imperative programs (Thesis, TU Darmstadt)
• AN EXTENSION OF AN AUTOMATED TERMINATION METHOD OF RECURSIVE FUNCTIONS
• Second-order programs with preconditions
• scientific article; zbMATH DE number 1500561 (Why is no real title available?)
• Automated synthesis of induction axioms for programs with second-order recursion

Describes a project that uses

Uses Software

• ETPS

This page was built for publication: Automated termination analysis for programs with second-order recursion

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