Skip to main content
SpringerLink
Log in

Correctness of recursive flow diagram programs

  • Appendix
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1977 (MFCS 1977)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 53))

Abstract

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.

Supported in part by the U.S. National Science Foundation, Grant No. MCS 72-03633 A04.

Partially supported by a March Foundation Research Fellowship.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. ADJ (coauthored by J. A. Goguen, J. W. Thatcher, E.C. Wagner and J. B. Wright) (1975) "An introduction to categories, algebraic theories and algebras," IBM Research Report RC 5369.

    Google Scholar 

  2. (1976) "A junction between computer science and category theory: I, Basic definitions and examples," Part 2, IBM Research Report RC 5908.

    Google Scholar 

  3. Burstall, R. M. (1972) "An algebraic description of programs with assertions, verification, and simulation," Proc ACM Confr. Proving Assertions about programs, Las Cruces, New Mexico, 7–14.

    Google Scholar 

  4. Eilenberg, S., and Wright, J. B. (1967) "Automata in general algebras," Inf. Control 11, 452–470.

    Article  Google Scholar 

  5. Goguen, J. A. (1974) "On homomorphisms, correctness termination, unfoldments and equivalence of flow diagram programs," J. Comp. Sys. Sci. 8, 333–365.

    Google Scholar 

  6. (1974a) "Set theoretic correctness proofs," Semantics and Theory of Computation Report No. 1, UCLA Computer Science Dept.

    Google Scholar 

  7. Lawvere, F. W. (1963) "Functorial semantics of algebraic theories," thesis, Columbia University; summarized in Proc. Ntl. Acad. Sci. U.S.A. 50, 869–872.

    Google Scholar 

  8. Mac Lane, S. (1971) Category Theory for the Working Mathematician, Springer-Verlag.

    Google Scholar 

  9. Pareigis, B. (1970) Categories and functors, Academic Press, New York.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, UCLA, 90024, Los Angeles, California, USA

    J. A. Goguen

  2. Departamento de Algebra y Fundamentos, Facultad de Ciencias, Santiago de Compostela, Spain

    J. Meseguer

Authors
  1. J. A. Goguen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Meseguer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goguen, J.A., Meseguer, J. (1977). Correctness of recursive flow diagram programs. In: Gruska, J. (eds) Mathematical Foundations of Computer Science 1977. MFCS 1977. Lecture Notes in Computer Science, vol 53. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08353-7_183

Download citation

  • DOI: https://doi.org/10.1007/3-540-08353-7_183

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08353-5

  • Online ISBN: 978-3-540-37285-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation