TY - GEN

T1 - Correctness of recursive flow diagram programs

AU - Goguen, J. A.

AU - Meseguer, J.

PY - 1977/1/1

Y1 - 1977/1/1

N2 - This paper presents a simple algebraic description of the semantics of non-deterministic recursive flow diagram programs with parallel assignment, culminating in a method for proving their partial correctness which generalizes the well-known Floyd-Naur method for ordinary flow diagram programs. Our treatment involves first considering a program scheme, and then interpreting it in an appropriate semantic model. The program schemes are conveniently viewed as diagrams in an algebraic theory, with semantic model a relational algebra. Some examples are given in a simple programming language whose features correspond precisely to our algebraic framework.

AB - This paper presents a simple algebraic description of the semantics of non-deterministic recursive flow diagram programs with parallel assignment, culminating in a method for proving their partial correctness which generalizes the well-known Floyd-Naur method for ordinary flow diagram programs. Our treatment involves first considering a program scheme, and then interpreting it in an appropriate semantic model. The program schemes are conveniently viewed as diagrams in an algebraic theory, with semantic model a relational algebra. Some examples are given in a simple programming language whose features correspond precisely to our algebraic framework.

UR - http://www.scopus.com/inward/record.url?scp=85035065771&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85035065771&partnerID=8YFLogxK

U2 - 10.1007/3-540-08353-7_183

DO - 10.1007/3-540-08353-7_183

M3 - Conference contribution

AN - SCOPUS:85035065771

SN - 9783540083535

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 580

EP - 595

BT - Mathematical Foundations of Computer Science 1977 - Proceedings, 6th Symposium

A2 - Gruska, Jozef

PB - Springer-Verlag Berlin Heidelberg

T2 - 6th Symposium on Mathematical Foundations of Computer Science, MFCS 1977

Y2 - 5 September 1977 through 9 September 1977

ER -