Advertisement

Structural invariants for some classes of structured programs

  • Génand Jacob
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 64)

Keywords

Computation Path Program Scheme Iteration Formula Syntactic Tree Label Path 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. 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. 2.
    ARSAC J., "Langages sans étiquettes et transformations de programmes"; Second colloquium on Automata, Languages and Programming. Saarbrücken (1974)Google Scholar
  3. 3.
    BOHM C. and JACOPINI G., "Flow diagrams, Türing machines and languages with only two formation rules"; Comm. ACM 9 (1966), 366–371CrossRefGoogle Scholar
  4. 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–74Google Scholar
  5. 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. 6.
    GARLAND S.J. and LUCKHAM D.C., "Program Schemes, Recursion Schemes, and formal Languages"; J. Comput. Syst. Sci., 7 (1973) 119–160Google Scholar
  7. 7.
    HECHT M.S. and ULLMAN J.D., "Flow graph reducibility", SIAM J. Comput., 1 (1972) 188–202CrossRefGoogle Scholar
  8. 8.
    IANOV Iu. I., "The logical schemes of algorithms"; Problemy Kibernet., 1 (1960) 82–140Google Scholar
  9. 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–52Google Scholar
  10. 10.
    KASAT T., "Translatability of flowcharts into WHILE programs"; J. Comput. Syst. Sci., 9 (1974) 177–195Google Scholar
  11. 11.
    KNUTH D.E. and FLOYD R.W., "Notes on avoiding "GO TO" statements"; Information Processing Letters, 1 (1971); Errata (1972), 177CrossRefGoogle Scholar
  12. 12.
    KOSARAJU R., "Analysis of structured programs"; J. Comput. Syst. Sci., 9 (1974) 232–255Google Scholar
  13. 13.
    MANNA Z., "Mathematical theory of Computing"; Addison WesleyGoogle Scholar
  14. 14.
    NOLIN L., RUGGIU G., "Formalization of EXEL"; ACM Symposium on the principles of Programming Languages; Boston (1973)Google Scholar
  15. 15.
    JACOB G., "Programmes réductibles à une formule EXEL de rang donné"; Colloque ‘AFCET-Informatique 78'; Paris, novembre 1978.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1978

Authors and Affiliations

  • Génand Jacob
    • 1
    • 2
  1. 1.Université de Lille I I.E.E.A. Laboratoire d'InformatiqueVilleneuve d'ASCQFrance
  2. 2.L.I.T.P. (C.N.R.S., laboratoire associé no 248)France

Personalised recommendations