@article{ITA_1977__11_2_133_0, author = {Guessarian, Ir\`ene}, title = {Les tests et leur caract\'erisation syntaxique}, journal = {RAIRO. Informatique th\'eorique}, pages = {133--156}, publisher = {Centrale des revues, Dunod-Gauthier-Villars}, address = {Montreuil}, volume = {11}, number = {2}, year = {1977}, mrnumber = {448988}, zbl = {0364.68018}, language = {fr}, url = {http://www.numdam.org/item/ITA_1977__11_2_133_0/} }
TY - JOUR AU - Guessarian, Irène TI - Les tests et leur caractérisation syntaxique JO - RAIRO. Informatique théorique PY - 1977 SP - 133 EP - 156 VL - 11 IS - 2 PB - Centrale des revues, Dunod-Gauthier-Villars PP - Montreuil UR - http://www.numdam.org/item/ITA_1977__11_2_133_0/ LA - fr ID - ITA_1977__11_2_133_0 ER -
Guessarian, Irène. Les tests et leur caractérisation syntaxique. RAIRO. Informatique théorique, Volume 11 (1977) no. 2, pp. 133-156. http://www.numdam.org/item/ITA_1977__11_2_133_0/
1. Bitransductions de forêts, Proceedings of the 3rd Int. Col. «Automata, Languages, Programming », Edinburgh Univ. Press, Edinburgh, 1976p. 74-86. | Zbl
et ,2. Nouvelles leçons de programmation, Publications de l'Institut de Programmation, n° 75-29, Université Paris 6, Paris, 1975. | MR
,3. The translation of GO TO programs to WHILE programs, Proceedings of the IFIP conference 1971, North-Holland, Amsterdam, 1971, p. 250-255. | MR
et ,4. A theory of programs, IBM seminar, Vienne, 1969, manuscrit non publié.
et ,5. Minimal and optimal computations of recursive programs, à paraître. | Zbl
et ,6. Langages d'arbres algébriques, à paraître dans la RAIRO, Paris, 1977.
,7. On the properties and applications of program schemes, Ph. D. Thesis, Stanford, 1973.
,8. Universal algebra, Harper's series in modem mathematics, Londres, 1965. | MR | Zbl
,9. On algebraic families of interpretations, à paraître.
et ,10. Langages d'interprétation des schémas récursifs, RAIRO, série rouge, vol. 9, Paris, 1975. p. 21-42. | Numdam | MR | Zbl
et .11. Structured programming, APIC studies on data processing, n° 8, Academic Press. Londres, 1972. | MR | Zbl
, et ,12. 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 | Zbl
,13. Notes on avoiding GO TO statements, Information processing letters, 1, 1971, p. 23-31.
et ,14. Deterministic languages and monadic recursion schemes, Ph. D. Thesis, Harvard University, 1974.
,15. Theory of program structures : schemes, semantics and verification, Lecture notes in computer science, Vol. 36, Springer-Verlag, 1975. | MR | Zbl
,16. Schémas de programme récursifs polyadiques : équivalences et classes d'interprétations, Thèse d'État, Université Paris 7, Paris, 1975.
,17. É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 | Zbl
,18. 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
,19. The logical schemes of algorithms, Problems of cybernetics, Pergamon Press, 1960, p. 82-140. | Zbl
,20. Sémantique algébrique d'un langage de programmation type ALGOL, à paraître dans la RAIRO, Paris, 1977. | Numdam | Zbl
,21. On formalized computer programs, J. Comp. Sys. Sc., Vol. 4, 1970, 220-249. | MR | Zbl
, et ,22. 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 | Zbl
,23. Mathematical theory of computation, Mac Graw Hill, Londres, 1975. | MR | Zbl
,24. Inductive methods for proving properties of programs, C. Ass. Comp. Mac. 16, 1973, p. 491-502. | MR | Zbl
, et ,25. Equivalences on program schemes, J. Comp. Sys. Sc, Vol. 4, 1970, p. 205-219. | MR | Zbl
,26. On the interpretation of recursive polyadic program schemes, Atti del convegno di informatica teorica, Symposia Mathematica, Vol. 15, Rome, 1975, p. 256-281. | MR | Zbl
,27. 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
,28. Fixpoint induction and proofs of program properties, Machine Intelligence, Vol. 5, Edinburgh University Press, Edinburgh, 1970, p. 59-78. | MR | Zbl
,29. Equivalence problems in a model of computation, Ph. D. Thesis, Artificial intelligence laboratory, M.I.T., 1967.
,30. On Ianov's program schemata, J. Ass. Comp. Mac, Vol. 11, 1964, p. 1-9. | MR | Zbl
,31. The lattice of flow diagrams, Symposium on semantics of algorithmic languages, Lecture notes in mathematics, Vol. 188, Springer-Verlag, 1971, p. 311-372. | MR | Zbl
,32. Translating recursion equations into flowcharts, J. Comp. Sys. Sc, Vol. 5, 1971, p. 254-285. | MR | Zbl
,33. Systematic programming, Prentice Hall, 1973.
,