scientific article

zbMath0656.68104MaRDI QIDQ3804237

Christoph Walther

Publication date: 1988

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Termination proofsmany-sorted data type

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mechanization of proofs and logical operations (03B35)

Related Items (9)

On proving the termination of algorithms by machine ⋮ Deriving constraints among argument sizes in logic programs ⋮ Size-based termination of higher-order rewriting ⋮ Termination of algorithms over non-freely generated data types ⋮ Termination checking with types ⋮ Shallow confluence of conditional term rewriting systems ⋮ Lazy generation of induction hypotheses ⋮ OBSCURE, a specification language for abstract data types ⋮ Termination analysis for partial functions

Uses Software

• LISP

This page was built for publication: