Equivalence of the Gries and Martin proof rules for procedure calls

A. Bijlsma; J.G. Wiltink; P.A. Matthews

doi:10.1007/BF00267863

Equivalence of the Gries and Martin proof rules for procedure calls

A. Bijlsma
, J.G. Wiltink
, P.A. Matthews

Mathematics and Computer Science

Research output: Contribution to journal › Article › Academic › peer-review

2 Citations (Scopus)

Abstract

In this note we prove the equivalence of the proof rules for procedure calls as given by D. Gries [1] and A.J. Martin [2]. We also discuss a modification of these proof rules for the case that the specification of a procedure contains free constants.

Original language	English
Pages (from-to)	357-360
Number of pages	4
Journal	Acta Informatica
Volume	23
Issue number	4
DOIs	https://doi.org/10.1007/BF00267863
Publication status	Published - 1986

Access to Document

10.1007/BF00267863

Cite this

@article{ff2f70ec1a624158a3a807ed4da128d5,

title = "Equivalence of the Gries and Martin proof rules for procedure calls",

abstract = "In this note we prove the equivalence of the proof rules for procedure calls as given by D. Gries [1] and A.J. Martin [2]. We also discuss a modification of these proof rules for the case that the specification of a procedure contains free constants.",

author = "A. Bijlsma and J.G. Wiltink and P.A. Matthews",

year = "1986",

doi = "10.1007/BF00267863",

language = "English",

volume = "23",

pages = "357--360",

journal = "Acta Informatica",

issn = "0001-5903",

publisher = "Springer",

number = "4",

}

TY - JOUR

T1 - Equivalence of the Gries and Martin proof rules for procedure calls

AU - Bijlsma, A.

AU - Wiltink, J.G.

AU - Matthews, P.A.

PY - 1986

Y1 - 1986

N2 - In this note we prove the equivalence of the proof rules for procedure calls as given by D. Gries [1] and A.J. Martin [2]. We also discuss a modification of these proof rules for the case that the specification of a procedure contains free constants.

AB - In this note we prove the equivalence of the proof rules for procedure calls as given by D. Gries [1] and A.J. Martin [2]. We also discuss a modification of these proof rules for the case that the specification of a procedure contains free constants.

U2 - 10.1007/BF00267863

DO - 10.1007/BF00267863

M3 - Article

SN - 0001-5903

VL - 23

SP - 357

EP - 360

JO - Acta Informatica

JF - Acta Informatica

IS - 4

ER -

Equivalence of the Gries and Martin proof rules for procedure calls

Abstract

Access to Document

Fingerprint

Cite this