{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T21:28:04Z","timestamp":1672694884727},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"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":10790,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1984]]},"DOI":"10.1016\/0304-3975(84)90103-8","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T21:44:32Z","timestamp":1034286272000},"page":"65-84","source":"Crossref","is-referenced-by-count":18,"title":["Fair termination revisited\u2014with delay"],"prefix":"10.1016","volume":"33","author":[{"given":"K.R.","family":"Apt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Pnueli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Stavi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(84)90103-8_BIB1","series-title":"Workshop on Logic of Programs","first-page":"1","article-title":"Proof rules dealing with fairness","volume":"131","author":"Apt","year":"1982"},{"key":"10.1016\/0304-3975(84)90103-8_BIB2","series-title":"Proc. 8th Colloquium on Automata Languages and Programming","first-page":"477","article-title":"A cook's tour of countable nondeterminism","volume":"115","author":"Apt","year":"1981"},{"key":"10.1016\/0304-3975(84)90103-8_BIB3","first-page":"127","article-title":"Computable non-deterministic functions","author":"Chandra","year":"1978","journal-title":"Proc. 19th Annual Symposium on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(84)90103-8_BIB4","series-title":"A Discipline of Programming","author":"Dijkstra","year":"1976"},{"key":"10.1016\/0304-3975(84)90103-8_BIB5","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1090\/psapm\/019\/0235771","article-title":"Assigning meanings to programs","volume":"19","author":"Floyd","year":"1967","journal-title":"Proc. AMS Symposium in Applied Mathematics"},{"key":"10.1016\/0304-3975(84)90103-8_BIB6","series-title":"Algorithmic Languages","first-page":"399","article-title":"A proof rule for fair termination of guarded commands","author":"Gr\u00fcmberg","year":"1981"},{"key":"10.1016\/0304-3975(84)90103-8_BIB7","series-title":"Proc. 8th Symposium on Mathematical Foundations of Computer Science","first-page":"108","article-title":"Full abstraction of a simple programming language","volume":"74","author":"Hennessy","year":"1979"},{"issue":"10","key":"10.1016\/0304-3975(84)90103-8_BIB8_1","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","article-title":"An axiomatic basis of computer programming","volume":"12","author":"Hoare","year":"1969","journal-title":"Comm. ACM"},{"issue":"10","key":"10.1016\/0304-3975(84)90103-8_BIB8_2","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1145\/363235.363259","article-title":"An axiomatic basis of computer programming","volume":"12","author":"Hoare","year":"1969","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(84)90103-8_BIB9","series-title":"Proc. 8th Colloquium on Automata Languages and Programming","first-page":"264","article-title":"Impartiality, justice and fairness: The ethics of concurrent termination","volume":"115","author":"Lehmann","year":"1981"},{"key":"10.1016\/0304-3975(84)90103-8_BIB10","series-title":"Mathematical Theory of Computation","author":"Manna","year":"1974"},{"key":"10.1016\/0304-3975(84)90103-8_BIB11","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF00288637","article-title":"Axiomatic approach to total correctness","volume":"3","author":"Manna","year":"1974","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(84)90103-8_BIB12","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00268134","article-title":"An axiomatic proof technique for parallel programs","volume":"6","author":"Owicki","year":"1976","journal-title":"Acta Inform."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397584901038?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397584901038?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T21:59:07Z","timestamp":1555192747000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397584901038"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1984]]}},"alternative-id":["0304397584901038"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(84)90103-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1984]]}}}