Les tests et leur caractérisation syntaxique
Guessarian, Irène
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 11 (1977), p. 133-156 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU) 
@article{ITA_1977__11_2_133_0,
     author = {Guessarian, Ir\`ene},
     title = {Les tests et leur caract\'erisation syntaxique},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {11},
     year = {1977},
     pages = {133-156},
     mrnumber = {448988},
     zbl = {0364.68018},
     language = {fr},
     url = {http://dml.mathdoc.fr/item/ITA_1977__11_2_133_0}
}

Guessarian, Irène. Les tests et leur caractérisation syntaxique. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 11 (1977) pp. 133-156. http://gdmltest.u-ga.fr/item/ITA_1977__11_2_133_0/

1. A. Arnold et M. Dauchet, Bitransductions de forêts, Proceedings of the 3rd Int. Col. «Automata, Languages, Programming », Edinburgh Univ. Press, Edinburgh, 1976p. 74-86. | Zbl 0363.68104

2. J. Arsac, Nouvelles leçons de programmation, Publications de l'Institut de Programmation, n° 75-29, Université Paris 6, Paris, 1975. | MR 329303

3. E. Ashcroft et Z. Manna, The translation of GO TO programs to WHILE programs, Proceedings of the IFIP conference 1971, North-Holland, Amsterdam, 1971, p. 250-255. | MR 400762

4. J. W. De Bakker et D. Scott, A theory of programs, IBM seminar, Vienne, 1969, manuscrit non publié.

5. G. Berry et J. J. Lévy, Minimal and optimal computations of recursive programs, à paraître. | Zbl 0388.68012

6. G. Boudol, Langages d'arbres algébriques, à paraître dans la RAIRO, Paris, 1977.

7. A. K. Chandra, On the properties and applications of program schemes, Ph. D. Thesis, Stanford, 1973.

8. P. M. Cohn, Universal algebra, Harper's series in modem mathematics, Londres, 1965. | MR 175948 | Zbl 0141.01002

9. B. Courcelle et I. Guessarian, On algebraic families of interpretations, à paraître.

10. G. Cousineau et J. M. Rifflet. Langages d'interprétation des schémas récursifs, RAIRO, série rouge, vol. 9, Paris, 1975. p. 21-42. | Numdam | MR 411250 | Zbl 0331.68007

11. O. J. Dahl, E. Dijkstra et C. A. R. Hoare, Structured programming, APIC studies on data processing, n° 8, Academic Press. Londres, 1972. | MR 433938 | Zbl 0267.68001

12. R. W. Floyd, Assigning meanings to programs, Proceedings of a symposium in applied mathematics, Vol. 19, Mathematical aspects of computer science, Rhodes Island, Amer. Math. Soc, 1967, p. 19-32. | MR 235771 | Zbl 0189.50204

13. R. W. Floyd et D. E. Knuth, Notes on avoiding GO TO statements, Information processing letters, 1, 1971, p. 23-31.

14. E. P. Friedmann, Deterministic languages and monadic recursion schemes, Ph. D. Thesis, Harvard University, 1974.

15. S. A. Greibach, Theory of program structures : schemes, semantics and verification, Lecture notes in computer science, Vol. 36, Springer-Verlag, 1975. | MR 431768 | Zbl 0345.68002

16. I. Guessarian, Schémas de programme récursifs polyadiques : équivalences et classes d'interprétations, Thèse d'État, Université Paris 7, Paris, 1975.

17. I. Guessarian, Équivalences dans l'algèbre des schémas de programme, Proceedings of the 1st Programming symposium, Lecture notes in computer science, Vol. 19, Springer-Verlag, 1974, p. 204-220. | MR 451823 | Zbl 0296.68015

18. I. Guessarian, Semantic equivalence of program schemes and its syntactic characterization, Proceedings of the 3rd Int. Col. «Automata, Languages, Programming», Edinburgh Univ. Press, Edinburgh, 1976, p. 189-200. | Zbl 0364.68019

19. I. Ianov, The logical schemes of algorithms, Problems of cybernetics, Pergamon Press, 1960, p. 82-140. | Zbl 0142.24801

20. L. Kott, Sémantique algébrique d'un langage de programmation type ALGOL, à paraître dans la RAIRO, Paris, 1977. | Numdam | Zbl 0369.68008

21. D. Luckham, D. Park et M. Paterson, On formalized computer programs, J. Comp. Sys. Sc., Vol. 4, 1970, 220-249. | MR 275717 | Zbl 0209.18704

22. J. Mac Carthy, A basis for a mathematical theory of computation, Computer programming and formal Systems, P. Braffort, D. Hirschberg Eds., North-Holland, Amsterdam, 1963, p. 33-70. | MR 148258 | Zbl 0203.16402

23. Z. Manna, Mathematical theory of computation, Mac Graw Hill, Londres, 1975. | MR 400771 | Zbl 0353.68066

24. Z. Manna, S. Ness et J. Vuillemin, Inductive methods for proving properties of programs, C. Ass. Comp. Mac. 16, 1973, p. 491-502. | MR 366080 | Zbl 0278.68019

25. R. Milner, Equivalences on program schemes, J. Comp. Sys. Sc, Vol. 4, 1970, p. 205-219. | MR 276097 | Zbl 0209.18705

26. M. Nivat, On the interpretation of recursive polyadic program schemes, Atti del convegno di informatica teorica, Symposia Mathematica, Vol. 15, Rome, 1975, p. 256-281. | MR 391563 | Zbl 0346.68041

27. M. Nivat, Formalisation de la sémantique des langages de programmation, Bulletin de liaison de la recherche en informatique et automatique, n° 23, IRIA, Paris, 1976, p. 2-13. | Zbl 0333.68012

28. D. Park, Fixpoint induction and proofs of program properties, Machine Intelligence, Vol. 5, Edinburgh University Press, Edinburgh, 1970, p. 59-78. | MR 323149 | Zbl 0219.68007

29. M. Paterson, Equivalence problems in a model of computation, Ph. D. Thesis, Artificial intelligence laboratory, M.I.T., 1967.

30. J. D. Rutledge, On Ianov's program schemata, J. Ass. Comp. Mac, Vol. 11, 1964, p. 1-9. | MR 166097 | Zbl 0121.12107

31. D. Scott, The lattice of flow diagrams, Symposium on semantics of algorithmic languages, Lecture notes in mathematics, Vol. 188, Springer-Verlag, 1971, p. 311-372. | MR 278849 | Zbl 0228.68016

32. H. R. Strong, Translating recursion equations into flowcharts, J. Comp. Sys. Sc, Vol. 5, 1971, p. 254-285. | MR 278732 | Zbl 0239.68002

33. N. Wirth, Systematic programming, Prentice Hall, 1973.