A representative strong equivalence class for accessible flowchart schemes
Part of the Lecture Notes in Computer Science book series (LNCS, volume 75)
Unable to display preview. Download preview PDF.
- [BT]S. L. Bloom and R. Tindell, "Algebraic and graph theoretic characterizations of structured flowchart schemes." To appear in JTCS.Google Scholar
- [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
- [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
- [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
© Springer-Verlag Berlin Heidelberg 1979