On proving the termination of algorithms by machine
type: Item
instance of: scholarly article
title: On proving the termination of algorithms by machine
zbMATH Open document ID: 0938.68819
DOI: 10.1016/0004-3702(94)90063-9
author: Christoph Walther
published in: Artificial Intelligence
publication date: 2000-06-21T00:00:00Z
Mathematics Subject Classification ID: 68T15
zbMATH DE Number: 708642
describes a project that uses: Find
describes a project that uses: NQTHM
describes a project that uses: LISP
MaRDI profile type: Publication
full work available at URL: 0004-3702(94)90063-9
OpenAlex ID: W1987494796
cites work: Q3894958
cites work: The addition of bounded quantification and partial functions to a computational logic and its theorem prover
cites work: Q4054648
cites work: Q5677070
cites work: Proving termination with multiset orderings
cites work: Q5584402
cites work: A closer look at termination
cites work: Rotating discs of unconventional profile
cites work: Q4124327
cites work: Inductive methods for proving properties of programs
cites work: Axiomatic approach to total correctness of programs
cites work: Is “sometime” sometimes better than “always”?
cites work: A mechanical proof of the termination of Takeuchi's function
cites work: Proving termination of normalization functions for conditional expressions
cites work: Termination proofs for logic programs
cites work: Q4264710
cites work: Q3997095
cites work: Q3804237
cites work: Q4023458
description: scientific article; zbMATH DE number 708642