no. 4
Les modalités de la correction totale
RAIRO. Informatique théorique, Tome 16 (1982) no. 4, pp. 349-363. 
@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://archive.numdam.org/item/ITA_1982__16_4_349_0/}
}
TY  - JOUR
AU  - Fariñas Del Cerro, Luis
TI  - Les modalités de la correction totale
JO  - RAIRO. Informatique théorique
PY  - 1982
SP  - 349
EP  - 363
VL  - 16
IS  - 4
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1982__16_4_349_0/
LA  - fr
ID  - ITA_1982__16_4_349_0
ER  - 
%0 Journal Article
%A Fariñas Del Cerro, Luis
%T Les modalités de la correction totale
%J RAIRO. Informatique théorique
%D 1982
%P 349-363
%V 16
%N 4
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1982__16_4_349_0/
%G fr
%F 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://archive.numdam.org/item/ITA_1982__16_4_349_0/

[AW1]E. AshcroftetW. Wadge, Lucid, a Non Procedural Language with Iteration, Com. A.C.M., vol. 20, n° 7, July 1977, p. 519-526. | Zbl

[AW2]E. AshcroftetW. Wadge, Intermittent Assertion Proofs in Lucid, I.F.I.P. 77, p. 723-726. | MR | Zbl

[B]Burstall, Program Proving as Hand Simulation with a Little Induction, I.F.I.P. 74, p. 308-312. | MR | Zbl

[C]R. Carnap, Modalities and Quantification, J.S.L., vol. 11, n° 2, 1946, p. 33-64. | MR | Zbl

[E]E. Engeler, Algoritmic Properties of Structures, Math. Sys. The., vol. 1, n° 3, p. 183-185. | MR

[EP]P. Enjalbert, 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]Fariñas Del Cerro, Un principe de résolution en logique modale (à paraître). | Numdam | Zbl

[FL]Floyd, Assigning Meaning to Programs, Proc. Amer. Math. Soc. Symp. in App. Math., vol. 19, 1967, p. 19-31. | MR | Zbl

[H]D. Harel, First-Order Dynamic Logic, Lectures Notes in Computer Science, Springer Verlag, n° 68. | MR | Zbl

[HKP]Harel, Kozen et Parikh, Process Logic, Expressiveness, Decidebility, Completeness, F.O.C.S. 80, p. 129-142. | MR

[HO]Hoare, An Axiomatic Basic of Computer Programming, Com. A.C. M., vol.12, n° 10, 1969. | Zbl

[HC]Hughes et Cresswell, An Introduction to Modal Logic, Mathuem et Co., London, 1978. | Zbl

[K]Kröger, LAR: A Logic for Algohthmic Reasoning, Acta Informatica, 1977, p. 243-266. | Zbl

[Ml]Z. Manna, Properties of Programs and First Order Predicate Calculus, J.A.C.M., vol. 16, n° 2, 1969, p. 244-255. | Zbl

[M2]Z. Manna, Logics of Programs, Proc, I.F.I.P. 80, North-Holland, p, 41-52.

[MP]Z. MannaetA. Pnueli, The Modal Logic of Programs, Memo AIM-330 Stanford A.I. Laboratory, Sept. 1979.

[NW]Z. MannaetR. Waldinger, 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

[Mc]Mcarthur, Tense Logic, Reidel Publ., 1976. | MR | Zbl

[MCT] Mckinsey, et Tarski, Some Theorems about the Sentential Calculi of Lewis and Heyting, J.S.L., vol. 13, 1948, p. 1-15. | MR | Zbl

[MI] Minc, Communication personnelle.

[0] Orlowska, Resolution Systems and their Applications, I, II Fundamenta Informaticae, p. 235-267, p. 333-362. | MR | Zbl

[P] W. T. Parry, Modalities in the Survey System of Strict Implication, J.S.L., vol. 4, 1939, p. 131-154. | JFM | Zbl

[PR] V. R. Pratt, 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] Rasiowa et Sikorski, The Mathematics of Metamathematics, Warszowa, 1963. | Zbl

[R] Robinson, A Machine Oriented Logic Based on the Resolution Principle, J.A.C.M., vol.12, 1965, p. 23-41. | MR | Zbl

[S] Salwicki, Formatized Algorithme Language, Bull. Ac. Pol. Sc., vol. 18, n° 5, 1970, p. 227-232. | MR | Zbl

[VE] M. Van Emden, Verification Conditions as Programs, Automate Languages and Programming, MICHEALSON and MILNER, éd., Edinburg Univ. Press, 1976, p. 99-119. | Zbl