{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:27Z","timestamp":1725663747038},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540566250"},{"type":"electronic","value":"9783540476139"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56625-2_16","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:23:18Z","timestamp":1330255398000},"page":"233-249","source":"Crossref","is-referenced-by-count":4,"title":["An operational semantics for the guarded command language"],"prefix":"10.1007","author":[{"given":"Johan J.","family":"Lukkien","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"16_CR1","first-page":"181","volume":"21","author":"B. Alpern","year":"1985","unstructured":"Alpern, B., Schneider, F.B.: Defining liveness. I.P.L. 21 (1985) 181\u2013185","journal-title":"I.P.L."},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Back, R.J.R.: Refinement calculus, part II: parallel and reactive programs. report ser. A, no. 93 (1989) \u00c5bo Akademi Finland","DOI":"10.1007\/3-540-52559-9_61"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Back R.J.R., Sere, K.: Stepwise refinement of action systems. In: Mathematics of program construction (J.L.A. van de Snepscheut (ed)), Springer-Verlag LNCS 375 (1989) 115\u2013138","DOI":"10.1007\/3-540-51305-1_7"},{"key":"16_CR4","volume-title":"Parallel programming, a foundation","author":"K.M. Chandy","year":"1988","unstructured":"Chandy, K.M., Misra, J.: Parallel programming, a foundation. Addison-Wesley publishing company, Reading 1988"},{"key":"16_CR5","volume-title":"Introduction to lattices and order","author":"B.A. Davey","year":"1990","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to lattices and order. Cambridge University Press, Cambridge 1990"},{"key":"16_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-3228-5","volume-title":"Predicate calculus and program semantics","author":"E.W. Dijkstra","year":"1990","unstructured":"Dijkstra, E.W., Sch\u00f6lten, C.S.: Predicate calculus and program semantics. Springer-Verlag, New York 1990."},{"key":"16_CR7","first-page":"323","volume":"33","author":"E. Knapp","year":"1989\/1990","unstructured":"Knapp, E., A predicate transformer for progress, I.P.L. 33 (1989\/1990) 323\u2013330","journal-title":"I.P.L."},{"key":"16_CR8","first-page":"373","volume-title":"Algorithmic Languages","author":"R. Kuiper","year":"1981","unstructured":"Kuiper, R.: An operational semantics for bounded nondeterminism equivalent to a denotational one. In: Algorithmic Languages, de Bakker\/van Vliet (eds) 373\u2013398, IFIP, North Holland 1981"},{"key":"16_CR9","volume-title":"PhD thesis","author":"J.J. Lukkien","year":"1991","unstructured":"Lukkien, J.J.: Parallel program design and generalized weakest preconditions. PhD thesis, Groningen University The Netherlands 1991"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Manna, Z., Pnueli, A.: How to cook a temporal proof system for your pet language. Proceedings POPL (ACM) 141\u2013153, Austin 1983","DOI":"10.1145\/567067.567082"},{"key":"16_CR11","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF00264610","volume":"27","author":"J.M. Morris","year":"1990","unstructured":"Morris, J.M.: Temporal predicate transformers and fair termination. Acta Informatica 27 (1990) 287\u2013313","journal-title":"Acta Informatica"},{"key":"16_CR12","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF01212336","volume":"4","author":"J.L.A. Snepscheut van de","year":"1992","unstructured":"van de Snepscheut, J.L.A., Lukkien, J.J.: Weakest preconditions for progress. Formal Aspects of Computing 4 (1992) 195\u2013236","journal-title":"Formal Aspects of Computing"}],"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-56625-2_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:05:11Z","timestamp":1605647111000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56625-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540566250","9783540476139"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-56625-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}