On the completeness of the inductive assertion method
type: Item
instance of: scholarly article
title: On the completeness of the inductive assertion method
zbMATH Open document ID: 0353.68040
DOI: 10.1016/S0022-0000(75)80056-0
author: L. G. L. T. Meertens
author: J. W. de Bakker
published in: Journal of Computer and System Sciences
publication date: 1975-01-01T00:00:00Z
Mathematics Subject Classification ID: 68N01
zbMATH DE Number: 3550155
MaRDI profile type: Publication
cites work: Decidable Properties of Monadic Functional Schemas
cites work: Q5181349
cites work: Q5678412
cites work: Q5674964
cites work: Q5584402
cites work: Q5576254
cites work: Q4168046
cites work: An axiomatic basis for computer programming
cites work: Q5812175
cites work: Q4772698
cites work: Mathematical theory of partial correctness
cites work: Inductive methods for proving properties of programs
cites work: Formalization of Properties of Functional Programs
cites work: Fixpoint approach to the theory of computation
full work available at URL: s0022-0000(75)80056-0
OpenAlex ID: W2113090411
description: scientific article; zbMATH DE number 3550155