Equivalence of the Gries and Martin proof rules for procedure calls

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

Research output: Contribution to journalArticleAcademicpeer-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 languageEnglish
Pages (from-to)357-360
Number of pages4
JournalActa Informatica
Volume23
Issue number4
DOIs
Publication statusPublished - 1986

Fingerprint Dive into the research topics of 'Equivalence of the Gries and Martin proof rules for procedure calls'. Together they form a unique fingerprint.

Cite this