@article{ITA_1982__16_4_349_0, author = {Fari\~nas Del Cerro, Luis}, title = {Les modalit\'es de la correction totale}, journal = {RAIRO. Informatique th\'eorique}, pages = {349--363}, publisher = {EDP-Sciences}, volume = {16}, number = {4}, year = {1982}, mrnumber = {707636}, zbl = {0506.03004}, language = {fr}, url = {http://www.numdam.org/item/ITA_1982__16_4_349_0/} }
Fariñas Del Cerro, Luis. Les modalités de la correction totale. RAIRO. Informatique théorique, Tome 16 (1982) no. 4, pp. 349-363. http://www.numdam.org/item/ITA_1982__16_4_349_0/
[AW1]Lucid, a Non Procedural Language with Iteration, Com. A.C.M., vol. 20, n° 7, July 1977, p. 519-526. | Zbl
et ,[AW2]Intermittent Assertion Proofs in Lucid, I.F.I.P. 77, p. 723-726. | MR | Zbl
et ,[B]Program Proving as Hand Simulation with a Little Induction, I.F.I.P. 74, p. 308-312. | MR | Zbl
,[C]Modalities and Quantification, J.S.L., vol. 11, n° 2, 1946, p. 33-64. | MR | Zbl
,[E]Algoritmic Properties of Structures, Math. Sys. The., vol. 1, n° 3, p. 183-185. | MR
,[EP]Systèmes de déduction pour les arbres et les schémas de programmes, R.A.I.R.O. Inform. Théor., vol. 14, n° 3, 1980, p. 247-278. | Numdam | MR | Zbl
,[F]Un principe de résolution en logique modale (à paraître). | Numdam | Zbl
,[FL]Assigning Meaning to Programs, Proc. Amer. Math. Soc. Symp. in App. Math., vol. 19, 1967, p. 19-31. | MR | Zbl
,[H]First-Order Dynamic Logic, Lectures Notes in Computer Science, Springer Verlag, n° 68. | MR | Zbl
,[HKP]Process Logic, Expressiveness, Decidebility, Completeness, F.O.C.S. 80, p. 129-142. | MR
, et ,[HO]An Axiomatic Basic of Computer Programming, Com. A.C. M., vol.12, n° 10, 1969. | Zbl
,[HC]An Introduction to Modal Logic, Mathuem et Co., London, 1978. | Zbl
et ,[K]LAR: A Logic for Algohthmic Reasoning, Acta Informatica, 1977, p. 243-266. | Zbl
,[Ml]Properties of Programs and First Order Predicate Calculus, J.A.C.M., vol. 16, n° 2, 1969, p. 244-255. | Zbl
,[M2]Logics of Programs, Proc, I.F.I.P. 80, North-Holland, p, 41-52.
,[MP]The Modal Logic of Programs, Memo AIM-330 Stanford A.I. Laboratory, Sept. 1979.
et ,[NW]Is "sometime" sometime better than "always"?: Intermittent Assertions in Proving Program Correcteness, Com. A.C.M., vol. 21, n° 2, 1978, p. 159-172. | MR | Zbl
et ,[Mc]Tense Logic, Reidel Publ., 1976. | MR | Zbl
,[MCT] Some Theorems about the Sentential Calculi of Lewis and Heyting, J.S.L., vol. 13, 1948, p. 1-15. | MR | Zbl
, et ,[MI] Communication personnelle.
,[0] Resolution Systems and their Applications, I, II Fundamenta Informaticae, p. 235-267, p. 333-362. | MR | Zbl
,[P] Modalities in the Survey System of Strict Implication, J.S.L., vol. 4, 1939, p. 131-154. | JFM | Zbl
,[PR] Semantical Considerations on Floyd-Hoare Logic, Proc. 17th Ann. I.E.E.E. Symp. on Foundations of Comp. Sc., 1976, p. 109-121. | MR
,[RS] The Mathematics of Metamathematics, Warszowa, 1963. | Zbl
et ,[R] A Machine Oriented Logic Based on the Resolution Principle, J.A.C.M., vol.12, 1965, p. 23-41. | MR | Zbl
,[S] Formatized Algorithme Language, Bull. Ac. Pol. Sc., vol. 18, n° 5, 1970, p. 227-232. | MR | Zbl
,[VE] Verification Conditions as Programs, Automate Languages and Programming, MICHEALSON and MILNER, éd., Edinburg Univ. Press, 1976, p. 99-119. | Zbl
,