Automated Termination Analysis for Programs with Second-Order Recursion

DOI10.1007/978-3-642-12002-2_18zbMath1284.68155OpenAlexW2131321020MaRDI QIDQ3557079

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

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

Related Items (1)

Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion

Uses Software

• ETPS

This page was built for publication: Automated Termination Analysis for Programs with Second-Order Recursion