Advertisement

A representative strong equivalence class for accessible flowchart schemes

  • Calvin C. Elgot
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 75)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BT]
    S. L. Bloom and R. Tindell, "Algebraic and graph theoretic characterizations of structured flowchart schemes." To appear in JTCS.Google Scholar
  2. [ES]
    C. C. Elgot and J. C. Shepherdson, "A semantically meaningful characterization of reducible flowchart schemes." To appear in JTCS. Also IBM Research Report RC-6656 (July 1977)Google Scholar
  3. [E-EB]
    C. C. Elgot, "The external behavior of machines." Proc. of 3rd Hawaii International Conference on System Sciences (1970) also IBM Research Report RC-2740 (December 1969).Google Scholar
  4. [E-SP]
    C. C. Elgot, "Structured programming with and without GO TO statements," IEEE Trans. on Software Eng. SE-2, No. 1 (March 1976). Erratum and Corrigendum IEEE Trans. on Software Eng. (September 1976).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Calvin C. Elgot

There are no affiliations available

Personalised recommendations