{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:39:19Z","timestamp":1720201159804},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"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":[[1985]]},"DOI":"10.1016\/0304-3975(85)90167-7","type":"journal-article","created":{"date-parts":[[2003,5,28]],"date-time":"2003-05-28T02:32:36Z","timestamp":1054089156000},"page":"211-235","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["While-programs with nondeterministic assignments and the logic ALNA"],"prefix":"10.1016","volume":"40","author":[{"given":"Gianfranco","family":"Mascari","sequence":"first","affiliation":[]},{"given":"Marisa","family":"Venturini Zilli","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(85)90167-7_BIB1","series-title":"Proc. ICALP'81","first-page":"479","article-title":"A. Cook's tour of countable non-determinism","volume":"115","author":"Apt","year":"1981"},{"key":"10.1016\/0304-3975(85)90167-7_BIB2","doi-asserted-by":"crossref","DOI":"10.1145\/6490.6494","article-title":"Countable nondeterminism and random assignment","author":"Apt","year":"1982"},{"key":"10.1016\/0304-3975(85)90167-7_BIB3","article-title":"Proof rules dealing with fairness","author":"Apt","year":"1981"},{"key":"10.1016\/0304-3975(85)90167-7_BIB4","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF00289263","article-title":"Proving total correctness of nondeterministic programs in infinitary logic","volume":"15","author":"Back","year":"1981","journal-title":"Acta Inform."},{"issue":"4","key":"10.1016\/0304-3975(85)90167-7_BIB5","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1145\/69622.357189","article-title":"A weaker precondition for loops","volume":"4","author":"Boom","year":"1982","journal-title":"Trans. Programm. Languages and Systems"},{"key":"10.1016\/0304-3975(85)90167-7_BIB6","series-title":"Seminaires INRIA, Languages et Transducteurs","article-title":"Unbounded nondeterminism: An exercise in abstract data types","author":"Broy","year":"1978"},{"key":"10.1016\/0304-3975(85)90167-7_BIB7","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0019-9958(82)90553-8","article-title":"Looping vs. repeating in dynamic logic","volume":"55","author":"Harel","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(85)90167-7_BIB8","first-page":"1","article-title":"Expressiveness of algorithmic logic for while-programs with nondeterministic assignments","volume":"158","author":"Mascari","year":"1983","journal-title":"Quaderni IAC, Serie III"},{"key":"10.1016\/0304-3975(85)90167-7_BIB9","first-page":"45","article-title":"Algorithmic logic with nondeterministic programs","volume":"3","author":"Mirkowska","year":"1980","journal-title":"Fund. Inform."},{"key":"10.1016\/0304-3975(85)90167-7_BIB10","first-page":"675","article-title":"PAL\u2014Propositional Algorithmic Logic","volume":"4","author":"Mirkowska","year":"1981","journal-title":"Fund. Inform."},{"key":"10.1016\/0304-3975(85)90167-7_BIB11","first-page":"1","article-title":"Lectures on infinitary logic and logics of programs","volume":"142","author":"Rasiowa","year":"1982","journal-title":"Quaderno IAC, Serie III"},{"key":"10.1016\/0304-3975(85)90167-7_BIB12","doi-asserted-by":"crossref","first-page":"193","DOI":"10.4064\/fm-37-1-193-200","article-title":"A proof of the completeness theorem of G\u00f6del","volume":"37","author":"Rasiowa","year":"1950","journal-title":"Fund. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901677?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901677?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T01:54:16Z","timestamp":1553133256000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585901677"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":12,"alternative-id":["0304397585901677"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90167-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}