×

Les tests et leur caractérisation syntaxique. (French) Zbl 0364.68018


MSC:

68N01 General topics in the theory of software
PDF BibTeX XML Cite
Full Text: EuDML

References:

[1] 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. Zbl0363.68104 · Zbl 0363.68104
[2] 2. J. ARSAC, Nouvelles leçons de programmation, Publications de l’Institut de Programmation, n^\circ 75-29, Université Paris 6, Paris, 1975. MR329303
[3] 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. MR400762 · Zbl 0263.68016
[4] 4. J. W. DE BAKKER et D. SCOTT, A theory of programs, IBM seminar, Vienne, 1969, manuscrit non publié.
[5] 5. G. BERRY et J. J. LÉVY, Minimal and optimal computations of recursive programs, à paraître. Zbl0388.68012 · Zbl 0388.68012
[6] 6. G. BOUDOL, Langages d’arbres algébriques, à paraître dans la RAIRO, Paris, 1977.
[7] 7. A. K. CHANDRA, On the properties and applications of program schemes, Ph. D. Thesis, Stanford, 1973.
[8] 8. P. M. COHN, Universal algebra, Harper’s series in modem mathematics, Londres, 1965. Zbl0141.01002 MR175948 · Zbl 0141.01002
[9] 9. B. COURCELLE et I. GUESSARIAN, On algebraic families of interpretations, à paraître. · Zbl 0392.68009
[10] 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. Zbl0331.68007 MR411250 · Zbl 0331.68007
[11] 11. O. J. DAHL, E. DIJKSTRA et C. A. R. HOARE, Structured programming, APIC studies on data processing, n^\circ 8, Academic Press. Londres, 1972. Zbl0267.68001 MR433938 · Zbl 0267.68001
[12] 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. Zbl0189.50204 MR235771 · Zbl 0189.50204
[13] 13. R. W. FLOYD et D. E. KNUTH, Notes on avoiding GO TO statements, Information processing letters, 1, 1971, p. 23-31. · Zbl 1260.68047
[14] 14. E. P. FRIEDMANN, Deterministic languages and monadic recursion schemes, Ph. D. Thesis, Harvard University, 1974.
[15] 15. S. A. GREIBACH, Theory of program structures : schemes, semantics and verification, Lecture notes in computer science, Vol. 36, Springer-Verlag, 1975. Zbl0345.68002 MR431768 · Zbl 0345.68002
[16] 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] 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. Zbl0296.68015 MR451823 · Zbl 0296.68015
[18] 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. Zbl0364.68019 · Zbl 0364.68019
[19] 19. I. IANOV, The logical schemes of algorithms, Problems of cybernetics, Pergamon Press, 1960, p. 82-140. Zbl0142.24801 · Zbl 0142.24801
[20] 20. L. KOTT, Sémantique algébrique d’un langage de programmation type ALGOL, à paraître dans la RAIRO, Paris, 1977. Zbl0369.68008 · Zbl 0369.68008
[21] 21. D. LUCKHAM, D. PARK et M. PATERSON, On formalized computer programs, J. Comp. Sys. Sc., Vol. 4, 1970, 220-249. Zbl0209.18704 MR275717 · Zbl 0209.18704
[22] 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. Zbl0203.16402 MR148258 · Zbl 0203.16402
[23] 23. Z. MANNA, Mathematical theory of computation, Mac Graw Hill, Londres, 1975. Zbl0353.68066 MR400771 · Zbl 0353.68066
[24] 24. Z. MANNA, S. NESS et J. VUILLEMIN, Inductive methods for proving properties of programs, C. Ass. Comp. Mac. 16, 1973, p. 491-502. Zbl0278.68019 MR366080 · Zbl 0278.68019
[25] 25. R. MILNER, Equivalences on program schemes, J. Comp. Sys. Sc, Vol. 4, 1970, p. 205-219. Zbl0209.18705 MR276097 · Zbl 0209.18705
[26] 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. Zbl0346.68041 MR391563 · Zbl 0346.68041
[27] 27. M. NIVAT, Formalisation de la sémantique des langages de programmation, Bulletin de liaison de la recherche en informatique et automatique, n^\circ 23, IRIA, Paris, 1976, p. 2-13. Zbl0333.68012 · Zbl 0333.68012
[28] 28. D. PARK, Fixpoint induction and proofs of program properties, Machine Intelligence, Vol. 5, Edinburgh University Press, Edinburgh, 1970, p. 59-78. Zbl0219.68007 MR323149 · Zbl 0219.68007
[29] 29. M. PATERSON, Equivalence problems in a model of computation, Ph. D. Thesis, Artificial intelligence laboratory, M.I.T., 1967.
[30] 30. J. D. RUTLEDGE, On Ianov’s program schemata, J. Ass. Comp. Mac, Vol. 11, 1964, p. 1-9. Zbl0121.12107 MR166097 · Zbl 0121.12107
[31] 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. Zbl0228.68016 MR278849 · Zbl 0228.68016
[32] 32. H. R. STRONG, Translating recursion equations into flowcharts, J. Comp. Sys. Sc, Vol. 5, 1971, p. 254-285. Zbl0239.68002 MR278732 · Zbl 0239.68002
[33] 33. N. WIRTH, Systematic programming, Prentice Hall, 1973.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.