{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:23Z","timestamp":1761611063035},"reference-count":12,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"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":6591,"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":[[1995,7]]},"DOI":"10.1016\/0304-3975(94)00184-k","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T10:09:04Z","timestamp":1051265344000},"page":"185-197","source":"Crossref","is-referenced-by-count":3,"title":["Formalizing Dijkstra's predicate transformer wp in weak second-order logic"],"prefix":"10.1016","volume":"146","author":[{"given":"Rudolf","family":"Berghammer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bright","family":"Elbl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulf","family":"Schmerl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00184-K_bib1","doi-asserted-by":"crossref","first-page":"233","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."},{"key":"10.1016\/0304-3975(94)00184-K_bib2","series-title":"Proc. of the REX Workshop","article-title":"Predicate transformers and higher order logic","volume":"Vol. 666","author":"Back","year":"1993"},{"key":"10.1016\/0304-3975(94)00184-K_bib3","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/360933.360975","article-title":"Guarded commands, nondeterminacy and formal derivation of programs","volume":"18","author":"Dijkstra","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(94)00184-K_bib4","series-title":"A Discipline of Programming","author":"Dijkstra","year":"1976"},{"key":"10.1016\/0304-3975(94)00184-K_bib5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-3228-5","article-title":"Predicate Calculus and Program Semantics","author":"Dijkstra","year":"1990"},{"key":"10.1016\/0304-3975(94)00184-K_bib6","article-title":"Fundamentals of Algebraic Specifications 1. Equations and Initial Semantics","volume":"Vol. 6","author":"Ehrig","year":"1985"},{"key":"10.1016\/0304-3975(94)00184-K_bib7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-5983-1","article-title":"The Science of Programming","author":"Gries","year":"1981"},{"key":"10.1016\/0304-3975(94)00184-K_bib8","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","article-title":"An axiomatic basis for computer programming","volume":"12","author":"Hoare","year":"1969","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(94)00184-K_bib9","series-title":"Languages with Expressions of Infinite Length","author":"Karp","year":"1964"},{"key":"10.1016\/0304-3975(94)00184-K_bib10","series-title":"Model Theory of Infinitary Logic","author":"Keisler","year":"1971"},{"key":"10.1016\/0304-3975(94)00184-K_bib11","series-title":"The Foundations of Program Verification","author":"Loeckx","year":"1984"},{"key":"10.1016\/0304-3975(94)00184-K_bib12","series-title":"Logic and Computer Science","article-title":"Making computers safe for the world: An introduction to proofs of programs","volume":"Vol. 1429","author":"Platek","year":"1990"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400184K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400184K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T07:23:22Z","timestamp":1556522602000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759400184K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":12,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["030439759400184K"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00184-k","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}