@article{ITA_1982__16_4_349_0,
author = {Fari\~nas Del Cerro, Luis},
title = {Les modalit\'es de la correction totale},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
volume = {16},
year = {1982},
pages = {349-363},
mrnumber = {707636},
zbl = {0506.03004},
language = {fr},
url = {http://dml.mathdoc.fr/item/ITA_1982__16_4_349_0}
}
Fariñas Del Cerro, Luis. Les modalités de la correction totale. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 16 (1982) pp. 349-363. http://gdmltest.u-ga.fr/item/ITA_1982__16_4_349_0/
[AW1]et, Lucid, a Non Procedural Language with Iteration, Com. A.C.M., vol. 20, n° 7, July 1977, p. 519-526. | Zbl 0358.68033
[AW2]et, Intermittent Assertion Proofs in Lucid, I.F.I.P. 77, p. 723-726. | MR 474941 | Zbl 0363.68021
[B], Program Proving as Hand Simulation with a Little Induction, I.F.I.P. 74, p. 308-312. | MR 448980 | Zbl 0299.68012
[C], Modalities and Quantification, J.S.L., vol. 11, n° 2, 1946, p. 33-64. | MR 19562 | Zbl 0063.00713
[E], Algoritmic Properties of Structures, Math. Sys. The., vol. 1, n° 3, p. 183-185. | MR 224473
[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 593490 | Zbl 0441.68007
[F], Un principe de résolution en logique modale (à paraître). | Numdam | Zbl 0566.03007
[FL], Assigning Meaning to Programs, Proc. Amer. Math. Soc. Symp. in App. Math., vol. 19, 1967, p. 19-31. | MR 235771 | Zbl 0189.50204
[H], First-Order Dynamic Logic, Lectures Notes in Computer Science, Springer Verlag, n° 68. | MR 567695 | Zbl 0403.03024
[HKP], et , Process Logic, Expressiveness, Decidebility, Completeness, F.O.C.S. 80, p. 129-142. | MR 596055
[HO], An Axiomatic Basic of Computer Programming, Com. A.C. M., vol.12, n° 10, 1969. | Zbl 0179.23105
[HC] et , An Introduction to Modal Logic, Mathuem et Co., London, 1978. | Zbl 0205.00503
[K], LAR: A Logic for Algohthmic Reasoning, Acta Informatica, 1977, p. 243-266. | Zbl 0347.68016
[Ml], Properties of Programs and First Order Predicate Calculus, J.A.C.M., vol. 16, n° 2, 1969, p. 244-255. | Zbl 0198.22001
[M2], Logics of Programs, Proc, I.F.I.P. 80, North-Holland, p, 41-52.
[MP]et, The Modal Logic of Programs, Memo AIM-330 Stanford A.I. Laboratory, Sept. 1979.
[NW]et, 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 483642 | Zbl 0367.68011
[Mc], Tense Logic, Reidel Publ., 1976. | MR 536334 | Zbl 0371.02013
[MCT] , et , Some Theorems about the Sentential Calculi of Lewis and Heyting, J.S.L., vol. 13, 1948, p. 1-15. | MR 24396 | Zbl 0037.29409
[MI] , Communication personnelle.
[0] , Resolution Systems and their Applications, I, II Fundamenta Informaticae, p. 235-267, p. 333-362. | MR 591776 | Zbl 0472.68052
[P] , Modalities in the Survey System of Strict Implication, J.S.L., vol. 4, 1939, p. 131-154. | JFM 65.1105.04 | Zbl 0023.09902
[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 502164
[RS] et , The Mathematics of Metamathematics, Warszowa, 1963. | Zbl 0122.24311
[R] , A Machine Oriented Logic Based on the Resolution Principle, J.A.C.M., vol.12, 1965, p. 23-41. | MR 170494 | Zbl 0139.12303
[S] , Formatized Algorithme Language, Bull. Ac. Pol. Sc., vol. 18, n° 5, 1970, p. 227-232. | MR 270852 | Zbl 0198.02801
[VE] , Verification Conditions as Programs, Automate Languages and Programming, MICHEALSON and MILNER, éd., Edinburg Univ. Press, 1976, p. 99-119. | Zbl 0403.68015