Automatizing termination proofs of recursively defined functions
type: Item
instance of: scholarly article
title: Automatizing termination proofs of recursively defined functions
zbMATH Open document ID: 0829.68031
DOI: 10.1016/0304-3975(94)00021-2
author: Pascal Manoury
author: M. Simonot
published in: Theoretical Computer Science
publication date: 1995-04-06T00:00:00Z
Mathematics Subject Classification ID: 68N99
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 741091
zbMATH Keywords: ProPRe program synthesis system
MaRDI profile type: Publication
full work available at URL: 0304-3975(94)00021-2
OpenAlex ID: W1990295079
cites work: Q3477935
cites work: Q3108200
cites work: Recursive programming with proofs
Recommended article: Q4023458
Recommended article: Q4494365
Recommended article: AN EXTENSION OF AN AUTOMATED TERMINATION METHOD OF RECURSIVE FUNCTIONS
Recommended article: Termination Proofs for Recursive Functions in FoCaLiZe
Recommended article: Q4023948
Recommended article: Automatic Proofs of Termination With Elementary Interpretations
Recommended article: Automatic Termination Verification for Higher-Order Functional Programs
Recommended article: Automata-Based Termination Proofs
Recommended article: Q4610086
description: scientific article; zbMATH DE number 741091