{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T12:50:52Z","timestamp":1775739052400,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":11155,"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":[[1983]]},"DOI":"10.1016\/0304-3975(83)90066-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"83-109","source":"Crossref","is-referenced-by-count":58,"title":["Ten years of Hoare's logic: A survey\u2014 part II: Nondeterminism"],"prefix":"10.1016","volume":"28","author":[{"given":"Krzysztof R.","family":"Apt","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/0304-3975(83)90066-X_BIB1","first-page":"431","article-title":"Ten years of Hoare's logic, a survey\u2014Part I","volume":"3","author":"Apt","year":"1981","journal-title":"IOPLAS"},{"issue":"1","key":"10.1016\/0304-3975(83)90066-X_BIB2","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0167-6423(83)90004-7","article-title":"Proof rules and transformations dealing with fairness","volume":"3","author":"Apt","year":"1983","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0304-3975(83)90066-X_BIB3","series-title":"Tech. Rept. 82-7","article-title":"Countable nondeterminism and random assignment","author":"Apt","year":"1982"},{"key":"10.1016\/0304-3975(83)90066-X_BIB4","first-page":"146","article-title":"Fair termination revisited\u2014with delay","author":"Apt","year":"1982","journal-title":"Proc. 2nd Conf. on Foundations of Software Technology and Theoretical Computer Science"},{"key":"10.1016\/0304-3975(83)90066-X_BIB5","series-title":"Mathematical Theory of Program Correctness","author":"De Bakker","year":"1980"},{"issue":"1","key":"10.1016\/0304-3975(83)90066-X_BIB6","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1137\/0207005","article-title":"Soundness and completeness of an axiom system for program verification","volume":"7","author":"Cook","year":"1978","journal-title":"SIAM J. Comput."},{"issue":"8","key":"10.1016\/0304-3975(83)90066-X_BIB7","doi-asserted-by":"crossref","DOI":"10.1145\/360933.360975","article-title":"Guarded commands, nondeterminancy and formal derivation of programs","volume":"18","author":"Dijkstra","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(83)90066-X_BIB8","series-title":"A Discipline of Programming","author":"Dijkstra","year":"1976"},{"issue":"4","key":"10.1016\/0304-3975(83)90066-X_BIB9","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1145\/321420.321422","article-title":"Nondeterministic algorithms","volume":"14","author":"Floyd","year":"1967","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(83)90066-X_BIB10","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(83)90066-X_BIB11","article-title":"First-order Dynamic Logic","volume":"68","author":"Harel","year":"1979"},{"key":"10.1016\/0304-3975(83)90066-X_BIB12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/BFb0012779","article-title":"A programming lanuage for the inductive sets, and applications","volume":"140","author":"Harel","year":"1982"},{"key":"10.1016\/0304-3975(83)90066-X_BIB13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/3-540-09526-8_8","article-title":"Full abstraction for a simple programming language","volume":"74","author":"Hennessy","year":"1979"},{"issue":"19","key":"10.1016\/0304-3975(83)90066-X_BIB14","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","article-title":"An axiomatic basis for computer programming","volume":"12","author":"Hoare","year":"1969","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(83)90066-X_BIB15","series-title":"Tech. Rept. TR. 25.121","article-title":"Consistent formal theories of the semantics of programming languages","author":"Lauer","year":"1971"},{"key":"10.1016\/0304-3975(83)90066-X_BIB16","series-title":"Tech. Rept. IW 178-81","article-title":"Another proof for the completeness of a rule for the fair termination of guarded commands and another rule for their just termination","author":"Lehmann","year":"1981"},{"key":"10.1016\/0304-3975(83)90066-X_BIB17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1007\/3-540-10843-2_22","article-title":"Impartiality, justice and fairness: The ethics of concurrent termination","volume":"115","author":"Lehmann","year":"1981"},{"key":"10.1016\/0304-3975(83)90066-X_BIB18","series-title":"Proc. 6th IBM Symp. on Mathematical Foundations of Computer Science","article-title":"A predicate transformer for weak fair iteration","author":"Park","year":"1981"},{"issue":"1","key":"10.1016\/0304-3975(83)90066-X_BIB19","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."},{"issue":"3","key":"10.1016\/0304-3975(83)90066-X_BIB20","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF00265555","article-title":"Fairness and related properties in transition systems\u2014a temporal logic to deal with fairness","volume":"19","author":"Queille","year":"1983","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(83)90066-X_BIB21","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758390066X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758390066X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:50:13Z","timestamp":1555127413000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439758390066X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1983]]}},"alternative-id":["030439758390066X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(83)90066-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}