EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 21 / No 3 (1987) RAIRO-Theor. Inf. Appl., 21 3 (1987) 287-322 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 21, Number 3, 1987
Page(s) 287 - 322
DOI https://doi.org/10.1051/ita/1987210302871
Published online 01 February 2017
  1. 1. APT et DELPORTE [1983], Syntax-Directed Analysis of Liveness Properties, RR83-42, octobre 1983, L.I.T.P., Université de Paris-VII, France. [Google Scholar]
  2. 2. BARRINGER, KUIPER et PNUELI [1984], Now You May Compose Your Temporal Logic Specification, dans A.C.M.-Proceedings Theory of Computing. [Google Scholar]
  3. 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] [Google Scholar]
  4. 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. [Google Scholar]
  5. 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] [Google Scholar]
  6. 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. [Google Scholar]
  7. 7. HOARE [1969], An Axiomatic Basis for Computer Programming, dans Communications of A.C.M., vol. 12, 1969, p. 576-583. [Zbl: 0179.23105] [Google Scholar]
  8. 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. [Google Scholar]
  9. 9. LAMPORT [1980 b], The HOARE Logic of Concurrent Programs, dans Acta Informatica, vol. 14, 1980, p. 21-37. [MR: 581379] [Zbl: 0416.68032] [Google Scholar]
  10. 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] [Google Scholar]
  11. 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. [Google Scholar]
  12. 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. [Google Scholar]
  13. 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. [Zbl: 0528.68008] [Google Scholar]
  14. 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] [Google Scholar]
  15. 15. OWICKI et LAMPORT [1982], Proving Liveness Properties of Concurrent Programs, dans ACM-TOPLAS, vol. 4, (3), 1982, p. 455-495. [Zbl: 0483.68013] [Google Scholar]
  16. 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. [Google Scholar]
  17. 17. PNUELI [1977], The Temporal Logic of Programs, dans Proc. 18th Symposium on Foundations of Computer Science, Ri, 1977, p. 46-57. [MR: 502161] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.