Méthode axiomatique sur les propriétés de fatalité des programmes parallèles
Mery, Dominique
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 21 (1987), p. 287-322 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1987-01-01
@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},
     volume = {21},
     year = {1987},
     pages = {287-322},
     mrnumber = {910080},
     zbl = {0623.68027},
     language = {fr},
     url = {http://dml.mathdoc.fr/item/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) pp. 287-322. http://gdmltest.u-ga.fr/item/ITA_1987__21_3_287_0/

1. Apt et Delporte [1983], Syntax-Directed Analysis of Liveness Properties, RR83-42, octobre 1983, L.I.T.P., Université de Paris-VII, France.

2. Barringer, Kuiper et Pnueli [1984], Now You May Compose Your Temporal Logic Specification, dans A.C.M.-Proceedings Theory of Computing.

3. Burstall [1974], Program Proving as Hand Simulation with a Little Induction, dans Proceedings I.F.I.P, 1974, p. 308-312, Amsterdam 1974, The Netherlands. | MR 448980 | Zbl 0299.68012

4. Cousot [1985], 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.

5. Floyd [1967], Assigning Meaning to Programs, dans Proc. A.M.S. Symposium dans Applied Hath. Amer. Math. Soc., 1967, p. 19-31. | MR 235771 | Zbl 0189.50204

6. Gerth [1984], 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.

7. Hoare [1969], An Axiomatic Basis for Computer Programming, dans Communications of A.C.M., vol. 12, 1969, p. 576-583. | Zbl 0179.23105

8. Lamport [1980 a], SOMETIME is Sometimes Better than ALWAYS, dans Proceedings of the A.C.M. Symposium on the Principles of Programming Languages, 1980.

9. Lamport [1980 b], The HOARE Logic of Concurrent Programs, dans Acta Informatica, vol. 14, 1980, p. 21-37. | MR 581379 | Zbl 0416.68032

10. Lehman, Pnueli et Stavi [1981], 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 635142 | Zbl 0468.68026

11. Manna et Pnueli [1982], 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.

12. Manna et Pnueli [1983 a], How to Cook Your Temporal Proof System for Your Pet Language, dans Proceedings of P.O.P.L., 1983, Austin, Texas, janvier 1983.

13. Manna et Pnueli [1983 b], Proving Precedence Properties: the Temporal Way, dans Report N.STAN-CS-83-964, Department of Computer Science, Stanford University, U.S.A.

14. Manna et Pnueli [1984], 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 776776 | Zbl 0542.68014

15. Owicki et Lamport [1982], Proving Liveness Properties of Concurrent Programs, dans ACM-TOPLAS, vol. 4, (3), 1982, p. 455-495. | Zbl 0483.68013

16. Park [1981], 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.

17. Pnueli [1977], The Temporal Logic of Programs, dans Proc. 18th Symposium on Foundations of Computer Science, Ri, 1977, p. 46-57. | MR 502161