{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:53:06Z","timestamp":1725663186628},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540100034"},{"type":"electronic","value":"9783540393467"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1980]]},"DOI":"10.1007\/3-540-10003-2_59","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:01:32Z","timestamp":1330189292000},"page":"51-63","source":"Crossref","is-referenced-by-count":12,"title":["Semantics of unbounded nondeterminism"],"prefix":"10.1007","author":[{"given":"Ralph-Johan","family":"Back","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"6_CR1","unstructured":"BACK: On the correctness of refinement steps in program development. Dept. of Computer Science, Univ. of Helsinki, Report A-1978-4."},{"key":"6_CR2","unstructured":"BACK: Semantics of unbounded nondeterminism. Computing Centre of Univ. of Helsinki, Res. Rep. No 8, 1979."},{"key":"6_CR3","unstructured":"de BAKKER: Semantics of infinite processes using generalised trees. Math. Centrum Report IW 82\/77."},{"key":"6_CR4","unstructured":"BAUER: Design of a programming language for a program transformation system. GI-8. Jahrestagung, Informatik Fachbereich 16, Springer Verlag."},{"key":"6_CR5","unstructured":"BOOM: A weaker precondition for loops. Mathematisch Centrum report IW 104\/78."},{"key":"6_CR6","unstructured":"DIJKSTRA: A discipline of programming. Prentice-Hall, 1976."},{"key":"6_CR7","unstructured":"DIJKSTRA: Private communication."},{"issue":"3","key":"6_CR8","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/0022-0000(79)90006-0","volume":"19","author":"FRANCEZ & AL","year":"1979","unstructured":"FRANCEZ & AL: Semantics of nondeterminism, concurrency and communication. Journal of Computer and System Sciences. Vol. 19, No. 3, December 1979, pp. 290\u2013308.","journal-title":"Journal of Computer and System Sciences"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"HAREL & AL: A complete axiomatic system for proving deductions about recursive programs. Proc. 9th annual ACM Symp. on the Theory of Computing, Boulder, Colorado, May 1977.","DOI":"10.1145\/800105.803415"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"KOSINSKI: A straightforward denotational semantics for nondeterminant data flow programs. 5th Annual ACM Symposium on Principles of Programming languages, Tucson, January 1978.","DOI":"10.1145\/512760.512783"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"PLOTKIN: A powerdomain construction. SIAM J. of Computing 5, 3, September 1976.","DOI":"10.1137\/0205035"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10003-2_59.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:02:17Z","timestamp":1605643337000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10003-2_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980]]},"ISBN":["9783540100034","9783540393467"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-10003-2_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1980]]}}}