Equivalence of the Gries and Martin proof rules for procedure calls
type: Item
instance of: scholarly article
title: Equivalence of the Gries and Martin proof rules for procedure calls
zbMATH Open document ID: 0577.68019
DOI: 10.1007/BF00267863
author: A. Bijlsma
author: J. G. Wiltink
author: P. A. Matthews
published in: Acta Informatica
publication date: 1986-01-01T00:00:00Z
review text: In this note the authors prove the equivalence of the proof rules for procedure calls as given by \textit{D. Gries} [The science of programming (Berlin 1981; Zbl 0472.68003)] and \textit{A. J. Martin} [Acta Inf. 20, 301- 313 (1983; Zbl 0546.68012)]. They also discuss a modification of these proof rules for the case that the specification of a procedure contains free constants.
Mathematics Subject Classification ID: 68N01
zbMATH DE Number: 3924104
MaRDI profile type: Publication
cites work: Q3925859
cites work: A general proof rule for procedures in predicate transformer semantics
full work available at URL: https://doi.org/10.1007/bf00267863
OpenAlex ID: W2097395076
description: scientific article; zbMATH DE number 3924104