@article{ITA_1987__21_3_287_0, author = {Mery, Dominique}, title = {M\'ethode axiomatique sur les propri\'et\'es de fatalit\'e des programmes parall\`eles}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, pages = {287--322}, publisher = {EDP-Sciences}, volume = {21}, number = {3}, year = {1987}, mrnumber = {910080}, zbl = {0623.68027}, language = {fr}, url = {http://archive.numdam.org/item/ITA_1987__21_3_287_0/} }
TY - JOUR AU - Mery, Dominique TI - Méthode axiomatique sur les propriétés de fatalité des programmes parallèles JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1987 SP - 287 EP - 322 VL - 21 IS - 3 PB - EDP-Sciences UR - http://archive.numdam.org/item/ITA_1987__21_3_287_0/ LA - fr ID - ITA_1987__21_3_287_0 ER -
%0 Journal Article %A Mery, Dominique %T Méthode axiomatique sur les propriétés de fatalité des programmes parallèles %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1987 %P 287-322 %V 21 %N 3 %I EDP-Sciences %U http://archive.numdam.org/item/ITA_1987__21_3_287_0/ %G fr %F ITA_1987__21_3_287_0
Mery, Dominique. Méthode axiomatique sur les propriétés de fatalité des programmes parallèles. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 21 (1987) no. 3, pp. 287-322. http://archive.numdam.org/item/ITA_1987__21_3_287_0/
1. Syntax-Directed Analysis of Liveness Properties, RR83-42, octobre 1983, L.I.T.P., Université de Paris-VII, France.
et [1983],2. Now You May Compose Your Temporal Logic Specification, dans A.C.M.-Proceedings Theory of Computing.
, et [1984],3. Program Proving as Hand Simulation with a Little Induction, dans Proceedings I.F.I.P, 1974, p. 308-312, Amsterdam 1974, The Netherlands. | MR | Zbl
[1974],4. Fondements des méthodes de preuve d'invariance et de fatalité de programmes parallèles, Thèse d'état, novembre 1985, I.N.P.L.
[1985],5. Assigning Meaning to Programs, dans Proc. A.M.S. Symposium dans Applied Hath. Amer. Math. Soc., 1967, p. 19-31. | MR | Zbl
[1967],6. TRANSITION LOGIC: How to Reason About Temporal Properties of Programs in a Compositional Way, dans RUU-CS-83-17, février 1984, Rijsuni-versiteit Utrecht, The Netherlands.
[1984],7. An Axiomatic Basis for Computer Programming, dans Communications of A.C.M., vol. 12, 1969, p. 576-583. | Zbl
[1969],8. SOMETIME is Sometimes Better than ALWAYS, dans Proceedings of the A.C.M. Symposium on the Principles of Programming Languages, 1980.
[1980 a],9. The HOARE Logic of Concurrent Programs, dans Acta Informatica, vol. 14, 1980, p. 21-37. | MR | Zbl
[1980 b],10. Impartiality, Justice and Fairness: the Ethics of Concurrent Termination, dans I.C.A.L.P., 1981, L.N.C.S., n° 115, p. 264-277. | MR | Zbl
, et [1981],11. Verification of Concurrent Programs: Proving Eventuality by Well-Founded Ranking, dans Report N.STAN-CS-82-915, mai 1982, Department of Computer Science, Stanford University, U.S.A.
et [1982],12. How to Cook Your Temporal Proof System for Your Pet Language, dans Proceedings of P.O.P.L., 1983, Austin, Texas, janvier 1983.
et [1983 a],13. Proving Precedence Properties: the Temporal Way, dans Report N.STAN-CS-83-964, Department of Computer Science, Stanford University, U.S.A.
et [1983 b],14. Adequate Proof Principles for Invariance and Liveness Properties of Concurrent Programs, dans Science of Computer Programming, vol. 4, 1984, p. 257-289, North-Holland. | MR | Zbl
et [1984],15. Proving Liveness Properties of Concurrent Programs, dans ACM-TOPLAS, vol. 4, (3), 1982, p. 455-495. | Zbl
et [1982],16. A Predicate Transformer for Weak Fair Iteration, dans Proc. of The sixth I.B.M. Symposium on mathematical Foundations of Computer Science, Hakone, Japan, 1981.
[1981],17. The Temporal Logic of Programs, dans Proc. 18th Symposium on Foundations of Computer Science, Ri, 1977, p. 46-57. | MR
[1977],