{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T19:33:00Z","timestamp":1649014380252},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1994,4,1]],"date-time":"1994-04-01T00:00:00Z","timestamp":765158400000},"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":7047,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1994,4]]},"DOI":"10.1016\/0167-6423(94)90010-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:09:22Z","timestamp":1027656562000},"page":"137-155","source":"Crossref","is-referenced-by-count":6,"title":["Operational semantics and generalized weakest preconditions"],"prefix":"10.1016","volume":"22","author":[{"given":"Johan J.","family":"Lukkien","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(94)90010-8_BIB1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0020-0190(85)90056-0","article-title":"Defining liveness","volume":"21","author":"Alpern","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-6423(94)90010-8_BIB2","series-title":"Report Ser. A","article-title":"Refinement calculus, Part II: Parallel and reactive programs","author":"Back","year":"1989"},{"key":"10.1016\/0167-6423(94)90010-8_BIB3","series-title":"Mathematics of Program Construction","first-page":"115","article-title":"Stepwise refinement of action systems","volume":"375","author":"Back","year":"1989"},{"key":"10.1016\/0167-6423(94)90010-8_BIB4","series-title":"Parallel Programming: a foundation","author":"Chandy","year":"1988"},{"key":"10.1016\/0167-6423(94)90010-8_BIB5","series-title":"Introduction to Lattices and Order","author":"Davey","year":"1990"},{"key":"10.1016\/0167-6423(94)90010-8_BIB6","series-title":"A Discipline of Programming","author":"Dijkstra","year":"1976"},{"key":"10.1016\/0167-6423(94)90010-8_BIB7","series-title":"Predicate Calculus and Program Semantics","author":"Dijkstra","year":"1990"},{"key":"10.1016\/0167-6423(94)90010-8_BIB8","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0020-0190(90)90218-M","article-title":"A predicate transformer for progress","volume":"33","author":"Knapp","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-6423(94)90010-8_BIB9","series-title":"Algorithmic Languages","first-page":"373","article-title":"An operational semantics for bounded nondeterminism equivalent to a denotational one","author":"Kuiper","year":"1981"},{"key":"10.1016\/0167-6423(94)90010-8_BIB10","series-title":"Ph.D. Thesis","article-title":"Parallel program design and generalized weakest preconditions","author":"Lukkien","year":"1991"},{"key":"10.1016\/0167-6423(94)90010-8_BIB11","series-title":"Mathematics of Program Construction","first-page":"233","article-title":"An operational semantics for the guarded command language","volume":"669","author":"Lukkien","year":"1993"},{"key":"10.1016\/0167-6423(94)90010-8_BIB12","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1145\/567067.567082","article-title":"How to cook at temporal proof system for your pet language","author":"Manna","year":"1983","journal-title":"Proceedings Tenth ACM Symposium on Principles of Programming Languages"},{"key":"10.1016\/0167-6423(94)90010-8_BIB13","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF00264610","article-title":"Temporal predicate transformers and fair termination","volume":"27","author":"Morris","year":"1990","journal-title":"Acta Inform."},{"issue":"3","key":"10.1016\/0167-6423(94)90010-8_BIB14","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1145\/357172.357178","article-title":"Proving liveness properties of concurrent programs","volume":"4","author":"Owicki","year":"1982","journal-title":"ACM Trans. Programming Languages Syst."},{"key":"10.1016\/0167-6423(94)90010-8_BIB15","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF01212336","article-title":"Weakest preconditions for progress","volume":"4","author":"van de Snepscheut","year":"1992","journal-title":"Formal Aspects Comput."}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642394900108?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642394900108?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T17:55:31Z","timestamp":1555091731000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642394900108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,4]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1994,4]]}},"alternative-id":["0167642394900108"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(94)90010-8","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1994,4]]}}}