{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T09:52:09Z","timestamp":1648893129166},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1999,4,1]],"date-time":"1999-04-01T00:00:00Z","timestamp":922924800000},"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":5221,"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":[[1999,4]]},"DOI":"10.1016\/s0304-3975(98)00278-3","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T10:09:04Z","timestamp":1051265344000},"page":"385-405","source":"Crossref","is-referenced-by-count":3,"title":["Generating algebraic laws from imperative programs"],"prefix":"10.1016","volume":"217","author":[{"given":"H.Peter","family":"Gumm","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00278-3_BIB1","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1145\/357146.357150","article-title":"Ten years of Hoare's logic: a survey \u2014 Part I","volume":"3","author":"Apt","year":"1981","journal-title":"ACM Trans. Progr. Lang. Systems"},{"key":"10.1016\/S0304-3975(98)00278-3_BIB2","series-title":"Formal Methods","author":"Beth","year":"1962"},{"key":"10.1016\/S0304-3975(98)00278-3_BIB3","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1137\/0207005","article-title":"Soundness and completeness of an axiom system for program verification","volume":"7","author":"Cook","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(98)00278-3_BIB4","series-title":"Einf\u00fchrung in die Informatik","author":"Gumm","year":"1998"},{"key":"10.1016\/S0304-3975(98)00278-3_BIB5","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":"Commun. ACM"},{"key":"10.1016\/S0304-3975(98)00278-3_BIB6","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/322047.322062","article-title":"A new incompleteness result in Hoare's system","volume":"25","author":"Wand","year":"1978","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002783?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002783?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T04:51:12Z","timestamp":1555390272000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598002783"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,4]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,4]]}},"alternative-id":["S0304397598002783"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00278-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,4]]}}}