Skip to main content

Structural invariants for some classes of structured programs

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1978 (MFCS 1978)

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

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. ARSAC J., NOLIN L., RUGGIU G., VASSEUR J.P., "Le système de Programmation EXEL"; Revue technique Thompson-CSF vol. 6, 3 (1974)

    Google Scholar 

  2. ARSAC J., "Langages sans étiquettes et transformations de programmes"; Second colloquium on Automata, Languages and Programming. Saarbrücken (1974)

    Google Scholar 

  3. BOHM C. and JACOPINI G., "Flow diagrams, Türing machines and languages with only two formation rules"; Comm. ACM 9 (1966), 366–371

    Article  Google Scholar 

  4. COUSINEAU J., "Transformations de programmes itératifs"; in Programmation, Proceedings of the 2nd international symposium on Programming, edited by B. Robinet, Paris (1976 — DUNOD). 53–74

    Google Scholar 

  5. COUSINEAU J., "Arbres à feuilles indiciées et transformations de programmes"; thèse es sci. Mathématiques, Université de Paris VII, (1977)

    Google Scholar 

  6. GARLAND S.J. and LUCKHAM D.C., "Program Schemes, Recursion Schemes, and formal Languages"; J. Comput. Syst. Sci., 7 (1973) 119–160

    Google Scholar 

  7. HECHT M.S. and ULLMAN J.D., "Flow graph reducibility", SIAM J. Comput., 1 (1972) 188–202

    Article  Google Scholar 

  8. IANOV Iu. I., "The logical schemes of algorithms"; Problemy Kibernet., 1 (1960) 82–140

    Google Scholar 

  9. IRLIK J., "Translating some recursive procedures into iterative schemas"; in Programmation, Proceedings of the 2nd international symposium on Programming, edited by B. Robinet, Paris (1976 — DUNOD) 39–52

    Google Scholar 

  10. KASAT T., "Translatability of flowcharts into WHILE programs"; J. Comput. Syst. Sci., 9 (1974) 177–195

    Google Scholar 

  11. KNUTH D.E. and FLOYD R.W., "Notes on avoiding "GO TO" statements"; Information Processing Letters, 1 (1971); Errata (1972), 177

    Article  Google Scholar 

  12. KOSARAJU R., "Analysis of structured programs"; J. Comput. Syst. Sci., 9 (1974) 232–255

    Google Scholar 

  13. MANNA Z., "Mathematical theory of Computing"; Addison Wesley

    Google Scholar 

  14. NOLIN L., RUGGIU G., "Formalization of EXEL"; ACM Symposium on the principles of Programming Languages; Boston (1973)

    Google Scholar 

  15. JACOB G., "Programmes réductibles à une formule EXEL de rang donné"; Colloque ‘AFCET-Informatique 78'; Paris, novembre 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

J. Winkowski

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jacob, G. (1978). Structural invariants for some classes of structured programs. In: Winkowski, J. (eds) Mathematical Foundations of Computer Science 1978. MFCS 1978. Lecture Notes in Computer Science, vol 64. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08921-7_76

Download citation

  • DOI: https://doi.org/10.1007/3-540-08921-7_76

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08921-6

  • Online ISBN: 978-3-540-35757-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics