{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:33:35Z","timestamp":1757540015790},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1983,4,1]],"date-time":"1983-04-01T00:00:00Z","timestamp":418003200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11065,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1983,4]]},"DOI":"10.1016\/0167-6423(83)90004-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:09:22Z","timestamp":1027656562000},"page":"65-100","source":"Crossref","is-referenced-by-count":65,"title":["Proof rules and transformations dealing with fairness"],"prefix":"10.1016","volume":"3","author":[{"given":"K.R.","family":"Apt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.-R.","family":"Olderog","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(83)90004-7_BIB1","series-title":"Proc. Logics of Programs","first-page":"1","article-title":"Proof rules dealing with fairness (extended abstract)","volume":"131","author":"Apt","year":"1982"},{"key":"10.1016\/0167-6423(83)90004-7_BIB2","series-title":"Technical Report","article-title":"Countable nondeterminism and random assignment","author":"Apt","year":"1982"},{"key":"10.1016\/0167-6423(83)90004-7_BIB3","first-page":"146","article-title":"Fair termination revisited\u2014with delay","author":"Apt","year":"1982","journal-title":"Proc. 2nd Conference on Software Technology and Theoretical Computer Science"},{"key":"10.1016\/0167-6423(83)90004-7_BIB4","series-title":"Rapport de Recherche No 88","article-title":"Asynchronous iterative methods for solving a fixed point system of monotone equations in a complete lattice","author":"Cousot","year":"1977"},{"key":"10.1016\/0167-6423(83)90004-7_BIB5","series-title":"A Discipline of Programming","author":"Dijkstra","year":"1976"},{"key":"10.1016\/0167-6423(83)90004-7_BIB6_1","series-title":"Proc. ICALP 80","first-page":"169","article-title":"Characterizing correctness properties of parallel programs using fixpoints","volume":"85","author":"Emerson","year":"1980"},{"key":"10.1016\/0167-6423(83)90004-7_BIB6_2","author":"Fischer","year":"1982","journal-title":"Storage requirements for fair scheduling"},{"key":"10.1016\/0167-6423(83)90004-7_BIB7","series-title":"Proc. IFIP TC-2 Working Conference in Formal Description of Programming Concepts","first-page":"589","article-title":"Nondeterminism and the correctness of parallel programs","author":"Flon","year":"1978"},{"issue":"2","key":"10.1016\/0167-6423(83)90004-7_BIB8","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1137\/0210016","article-title":"The total correctness of parallel programs","volume":"10","author":"Flon","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-6423(83)90004-7_BIB9","series-title":"Proc. Symposium in Applied Mathematics, Vol. 19, Mathematical Aspects of Computer Science","first-page":"19","article-title":"Assigning meaning to programs","author":"Floyd","year":"1967"},{"key":"10.1016\/0167-6423(83)90004-7_BIB10","series-title":"Proc. International Symposium on Algorithmic Languages","first-page":"339","article-title":"A proof rule for fair termination of guarded commands","author":"Gr\u00fcmberg","year":"1981"},{"key":"10.1016\/0167-6423(83)90004-7_BIB11","series-title":"Proc. ICALP 81","first-page":"264","article-title":"Impartiality, justice and fairness: the ethics of concurrent termination","volume":"115","author":"Lehmann","year":"1981"},{"key":"10.1016\/0167-6423(83)90004-7_BIB12","article-title":"A predicate transformer for weak fair iteration","author":"Park","year":"1981","journal-title":"Proc. IBM Symposium on Mathematical Foundation of Computer Science"},{"key":"10.1016\/0167-6423(83)90004-7_BIB13","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(81)90110-9","article-title":"The temporal semantics of concurrent programs","volume":"13","author":"Pnueli","year":"1981","journal-title":"Theoret. Comput. Sci."}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642383900047?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642383900047?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T17:50:04Z","timestamp":1555091404000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642383900047"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,4]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,4]]}},"alternative-id":["0167642383900047"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(83)90004-7","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1983,4]]}}}