{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T05:10:08Z","timestamp":1784351408596,"version":"3.55.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1987,12,1]],"date-time":"1987-12-01T00:00:00Z","timestamp":565315200000},"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":9360,"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":[[1987,12]]},"DOI":"10.1016\/0167-6423(87)90011-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:09:22Z","timestamp":1027642162000},"page":"287-306","source":"Crossref","is-referenced-by-count":213,"title":["A theoretical basis for stepwise refinement and the programming calculus"],"prefix":"10.1016","volume":"9","author":[{"given":"Joseph M.","family":"Morris","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(87)90011-6_BIB1","series-title":"Mathematical Logic and Programming Languages","first-page":"113","article-title":"Programming as a mathematical exercise","author":"Abrial","year":"1985"},{"key":"10.1016\/0167-6423(87)90011-6_BIB2","series-title":"Mathematical Theory of Program Correctness","author":"de Bakker","year":"1980"},{"key":"10.1016\/0167-6423(87)90011-6_BIB3","series-title":"Lattice Theory","author":"Birkhoff","year":"1961"},{"issue":"4","key":"10.1016\/0167-6423(87)90011-6_BIB4","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1145\/69622.357189","article-title":"A weaker precondition for loops","volume":"4","author":"Boom","year":"1982","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0167-6423(87)90011-6_BIB5","series-title":"A Discipline of Programming","author":"Dijkstra","year":"1976"},{"key":"10.1016\/0167-6423(87)90011-6_BIB6","series-title":"Selected Writings on Computing: a Personal Perpective","first-page":"358","article-title":"The equivalence of bounded nondeterminacy and continuity","author":"Dijkstra","year":"1982"},{"key":"10.1016\/0167-6423(87)90011-6_BIB7","series-title":"The Science of Programming","author":"Gries","year":"1981"},{"key":"10.1016\/0167-6423(87)90011-6_BIB8","series-title":"The Logic of Programming","author":"Hehner","year":"1984"},{"key":"10.1016\/0167-6423(87)90011-6_BIB9","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1145\/69610.357988","article-title":"Predicative programming part 1","volume":"27","author":"Hehner","year":"1984","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(87)90011-6_BIB10","series-title":"Mathematical Logic and Programming Languages","first-page":"141","article-title":"Programs are predicates","author":"Hoare","year":"1985"},{"key":"10.1016\/0167-6423(87)90011-6_BIB11","author":"Hoare","year":"1985","journal-title":"Laws of programming: a tutorial paper"},{"issue":"3","key":"10.1016\/0167-6423(87)90011-6_BIB12","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/0020-0190(82)90065-5","article-title":"Fixed point theorems and semantics: a folk tale","volume":"14","author":"Lassez","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-6423(87)90011-6_BIB13","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1145\/362575.362577","article-title":"Program development by stepwise refinement","volume":"14","author":"Wirth","year":"1971","journal-title":"Comm. ACM"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642387900116?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642387900116?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:51:07Z","timestamp":1555077067000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642387900116"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,12]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,12]]}},"alternative-id":["0167642387900116"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(87)90011-6","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1987,12]]}}}