{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T10:43:14Z","timestamp":1749724994051},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"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":7106,"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":[[1994,2]]},"DOI":"10.1016\/0304-3975(92)00016-k","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"273-295","source":"Crossref","is-referenced-by-count":11,"title":["Nondeterminacy and recursion via stacks and games"],"prefix":"10.1016","volume":"124","author":[{"given":"Wim H","family":"Hesselink","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)00016-K_BIB1","series-title":"Stepwise Refinement of Distributed Systems","first-page":"42","article-title":"Refinement calculus, Part I: sequential nondeterministic programs","volume":"Vol. 430","author":"Back","year":"1990"},{"key":"10.1016\/0304-3975(92)00016-K_BIB2","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/BF00259469","article-title":"Duality in specification languages: a lattice theoretical approach","volume":"27","author":"Back","year":"1990","journal-title":"Acta Inform."},{"issue":"VII","key":"10.1016\/0304-3975(92)00016-K_BIB3","first-page":"111","article-title":"Een bewijsmethode voor recursieve procedures","volume":"21","author":"de Bakker","year":"1975","journal-title":"Math. Centre Syllabus"},{"key":"10.1016\/0304-3975(92)00016-K_BIB4","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. ACM"},{"year":"1976","series-title":"A Discipline of Programming","author":"Dijkstra","key":"10.1016\/0304-3975(92)00016-K_BIB5"},{"year":"1990","series-title":"Predicate Calculus and Program Semantics","author":"Dijkstra","key":"10.1016\/0304-3975(92)00016-K_BIB6"},{"key":"10.1016\/0304-3975(92)00016-K_BIB7","first-page":"497","article-title":"Dynamic logic","volume":"Vol. 2","author":"Harel","year":"1984"},{"key":"10.1016\/0304-3975(92)00016-K_BIB8","series-title":"Beauty is Our Business a Birthday Salute to Edsger W. Dijkstra","first-page":"182","article-title":"Modalities of nondeterminacy","author":"Hesselink","year":"1990"},{"year":"1992","series-title":"Programs, Recursion and Unbounded Choice","author":"Hesselink","key":"10.1016\/0304-3975(92)00016-K_BIB9"},{"key":"10.1016\/0304-3975(92)00016-K_BIB10","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(92)90174-E","article-title":"Processes and formalisms for unbounded choice","volume":"99","author":"Hesselink","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)00016-K_BIB11","series-title":"Semantics: Foundations and Applications; Proc. REX Workshop June 1992","first-page":"236","article-title":"Temporal preconditions of recursive procedures","volume":"Vol. 666","author":"Hesselink","year":"1993"},{"year":"1985","series-title":"Communicating Sequential Processes","author":"Hoare","key":"10.1016\/0304-3975(92)00016-K_BIB12"},{"year":"1990","series-title":"Programming from Specifications","author":"Morgan","key":"10.1016\/0304-3975(92)00016-K_BIB13"},{"key":"10.1016\/0304-3975(92)00016-K_BIB14","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/BF00277386","article-title":"Data refinement by calculation","volume":"27","author":"Morgan","year":"1990","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(92)00016-K_BIB15","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0167-6423(87)90011-6","article-title":"A theoretical basis for stepwise refinement and the programming calculus","volume":"9","author":"Morris","year":"1987","journal-title":"Sci. Comput. Programming"},{"year":"1982","series-title":"Principles of Artificial Intelligence","author":"Nilsson","key":"10.1016\/0304-3975(92)00016-K_BIB16"},{"key":"10.1016\/0304-3975(92)00016-K_BIB17","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","article-title":"A lattice theoretical fixpoint theorem and its applications","volume":"5","author":"Tarski","year":"1955","journal-title":"Pacific J. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759200016K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759200016K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:26:24Z","timestamp":1555129584000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759200016K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["030439759200016K"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)00016-k","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}