{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:11:37Z","timestamp":1725664297600},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540601173"},{"type":"electronic","value":"9783540494454"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60117-1_18","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:43:25Z","timestamp":1330278205000},"page":"322-334","source":"Crossref","is-referenced-by-count":1,"title":["Angelic termination in Dijkstra's calculus"],"prefix":"10.1007","author":[{"given":"Wim H.","family":"Hesselink","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science 430","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/3-540-52559-9_60","volume-title":"Stepwise Refinement of Distributed Systems","author":"R.J.R. Back","year":"1990","unstructured":"R.J.R. Back, J. von Wright: Refinement calculus, Part I: Sequential Nondeterministic Programs. In: J.W. de Bakker, W.-P. de Roever, G. Rozenberg (eds.) Stepwise Refinement of Distributed Systems. Lecture Notes in Computer Science 430 (Springer, Berlin, 1990) pp. 42\u201366."},{"key":"18_CR2","doi-asserted-by":"crossref","first-page":"924","DOI":"10.1145\/177492.177727","volume":"16","author":"M. Broy","year":"1994","unstructured":"M. Broy, G. Nelson: Adding fair choice to Dijkstra's calculus. ACM Transactions on Programming Languages and Systems, 16 (1994) 924\u2013938.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"unstructured":"E.W. Dijkstra: A discipline of programming. Prentice-Hall 1976.","key":"18_CR3"},{"doi-asserted-by":"crossref","unstructured":"E.W. Dijkstra, CS. Scholten: Predicate calculus and program semantics. Springer V. 1990.","key":"18_CR4","DOI":"10.1007\/978-1-4612-3228-5"},{"unstructured":"H. Doornbos: A relational model of programs without the restriction to Egli-Milner-monotone constructs. In: E.-R. Olderog: Programming Concepts, Methods and Calculi. North-Holland, 1994, pp. 363\u2013382.","key":"18_CR5"},{"doi-asserted-by":"crossref","unstructured":"W.H. Hesselink: Programs, Recursion and Unbounded Choice. Cambridge Tracts in Theoretical Computer Science 27. Cambridge University Press 1992. ISBN 0521 404363.","key":"18_CR6","DOI":"10.1017\/CBO9780511569784"},{"key":"18_CR7","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1007\/BF01211249","volume":"5","author":"W.H. Hesselink","year":"1993","unstructured":"W.H. Hesselink: Proof rules for recursive procedures. Formal Aspects of Computing 5 (1993) 554\u2013570.","journal-title":"Formal Aspects of Computing"},{"key":"18_CR8","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0304-3975(92)00016-K","volume":"124","author":"W.H. Hesselink","year":"1994","unstructured":"W.H. Hesselink: Nondeterminacy and recursion via stacks and games. Theoretical Computer Science 124 (1994) 273\u2013295.","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"W.H. Hesselink: Safety and progress of recursive procedures. Formal Aspects of Computing (to appear).","key":"18_CR9","DOI":"10.1007\/BF01211215"},{"key":"18_CR10","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0020-0190(88)90147-0","volume":"26","author":"C.C. Morgan","year":"1987\/88","unstructured":"C.C. Morgan: Data refinement by miracles. Information Processing Letters 26 (1987\/88) 243\u2013246.","journal-title":"Information Processing Letters"},{"key":"18_CR11","volume-title":"Programming from Specifications","author":"C. Morgan","year":"1990","unstructured":"C. Morgan: Programming from Specifications. Prentice Hall, Englewood Cliffs, NJ, 1990."},{"key":"18_CR12","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/BF00277386","volume":"27","author":"C. Morgan","year":"1990","unstructured":"C. Morgan, P.H.B. Gardiner: Data refinement by calculation. Acta Informatica 27 (1990) 481\u2013503.","journal-title":"Acta Informatica"},{"key":"18_CR13","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0167-6423(87)90011-6","volume":"9","author":"J.M. Morris","year":"1987","unstructured":"J.M. Morris: A theoretical basis for stepwise refinement and the programming calculus. Science of Comp. Programming 9 (1987) 287\u2013306.","journal-title":"Science of Comp. Programming"},{"key":"18_CR14","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1145\/69558.69559","volume":"11","author":"G. Nelson","year":"1989","unstructured":"G. Nelson: A generalization of Dijkstra's calculus. ACM Transactions on Programming Languages and Systems, 11 (1989) 517\u2013561.","journal-title":"ACM Transactions on Programming Languages and Systems"}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60117-1_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T09:25:00Z","timestamp":1640942700000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60117-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540601173","9783540494454"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-60117-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}