{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T08:51:38Z","timestamp":1648630298117},"reference-count":17,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1987]]},"DOI":"10.1051\/ita\/1987210302871","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T10:08:50Z","timestamp":1486030130000},"page":"287-322","source":"Crossref","is-referenced-by-count":3,"title":["M\u00e9thode axiomatique sur les propri\u00e9t\u00e9s de fatalit\u00e9 des programmes parall\u00e8les"],"prefix":"10.1051","volume":"21","author":[{"given":"Dominique","family":"Mery","sequence":"first","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","unstructured":"1. APT et DELPORTE [1983], Syntax-Directed Analysis of Liveness Properties, RR83-42, octobre 1983, L.I.T.P., Universit\u00e9 de Paris-VII, France."},{"key":"R2","unstructured":"2. BARRINGER , KUIPER et PNUELI [1984], Now You May Compose Your Temporal Logic Specification, dans A.C.M.-Proceedings Theory of Computing."},{"key":"R3","unstructured":"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.4489800299.68012"},{"key":"R4","unstructured":"4. COUSOT [1985], Fondements des m\u00e9thodes de preuve d'invariance et de fatalit\u00e9 de programmes parall\u00e8les, Th\u00e8se d'\u00e9tat, novembre 1985, I.N.P.L."},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5. FLOYD [1967], Assigning Meaning to Programs, dans Proc. A.M.S. Symposium dans Applied Hath. Amer. Math. Soc., 1967, p. 19-31.2357710189.50204","DOI":"10.1090\/psapm\/019\/0235771"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. GERTH [1984], TRANSITION LOGIC: How to Reason About Temporal Properties of Programs in a Compositional Way, dans RUU-CS-83-17, f\u00e9vrier 1984, Rijsuni-versiteit Utrecht, The Netherlands.","DOI":"10.1145\/800057.808664"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"7. HOARE [1969], An Axiomatic Basis for Computer Programming, dans Communications of A.C.M., vol. 12, 1969, p. 576-583.0179.23105","DOI":"10.1145\/363235.363259"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/567446.567463"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"9. LAMPORT [1980 b], The HOARE Logic of Concurrent Programs, dans Acta Informatica, vol. 14, 1980, p. 21-37.5813790416.68032","DOI":"10.1007\/BF00289062"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"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\u00b0 115, p. 264-277.6351420468.68026","DOI":"10.1007\/3-540-10843-2_22"},{"key":"R11","unstructured":"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."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/567067.567082"},{"key":"R13","unstructured":"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.0528.68008"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"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.7767760542.68014","DOI":"10.1016\/0167-6423(84)90003-0"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"15. OWICKI et LAMPORT [1982], Proving Liveness Properties of Concurrent Programs, dans ACM-TOPLAS, vol. 4, (3), 1982, p. 455-495.0483.68013","DOI":"10.1145\/357172.357178"},{"key":"R16","unstructured":"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."},{"key":"R17","doi-asserted-by":"crossref","unstructured":"17. PNUELI [1977], The Temporal Logic of Programs, dans Proc. 18th Symposium on Foundations of Computer Science, Ri, 1977, p. 46-57.502161","DOI":"10.1109\/SFCS.1977.32"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1987210302871\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T01:59:20Z","timestamp":1568771960000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1987210302871"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"references-count":17,"journal-issue":{"issue":"3"},"alternative-id":["ita1987210302871"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1987210302871","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987]]}}}