{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T15:27:02Z","timestamp":1648567622200},"reference-count":20,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,10,1]],"date-time":"1983-10-01T00:00:00Z","timestamp":433814400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1983,10]]},"DOI":"10.1016\/0020-0190(83)90056-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:20:15Z","timestamp":1027657215000},"page":"155-160","source":"Crossref","is-referenced-by-count":1,"title":["Verifying programs by induction on their data structure: General format and applications"],"prefix":"10.1016","volume":"17","author":[{"given":"Ali","family":"Mili","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(83)90056-X_BIB1","first-page":"723","article-title":"Intermittent assertion proofs in Lucid","volume":"77","author":"Ashcroft","year":"1977"},{"issue":"1","key":"10.1016\/0020-0190(83)90056-X_BIB2","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1109\/TSE.1975.6312822","article-title":"Proving loop programs","volume":"SE-1","author":"Basu","year":"1975","journal-title":"Trans. Software Engineering"},{"key":"10.1016\/0020-0190(83)90056-X_BIB3","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1145\/800027.808445","article-title":"Select\u2014A system for testing and debugging programs by symbolic execution","author":"Boyer","year":"1975","journal-title":"Proc. 1975 Internat. Conf. on Reliable Software"},{"key":"10.1016\/0020-0190(83)90056-X_BIB4","first-page":"308","article-title":"Program proving as hand simulation with a little induction","volume":"74","author":"Burstall","year":"1974"},{"key":"10.1016\/0020-0190(83)90056-X_BIB5","series-title":"Universal Algebra","author":"Cohn","year":"1980"},{"key":"10.1016\/0020-0190(83)90056-X_BIB6","series-title":"Recursive procedures","author":"De Bakker","year":"1971"},{"key":"10.1016\/0020-0190(83)90056-X_BIB7","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1090\/psapm\/019\/0235771","article-title":"Assigning meanings to programs","author":"Floyd","year":"1967","journal-title":"Proc. Amer. Math. Soc. Symp. in Applied Mathematics"},{"issue":"2","key":"10.1016\/0020-0190(83)90056-X_BIB8","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1145\/357073.357080","article-title":"Is sometime ever better than always?","volume":"1","author":"Gries","year":"1979","journal-title":"ACM-TOPLAS"},{"issue":"10","key":"10.1016\/0020-0190(83)90056-X_BIB9_1","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"},{"issue":"10","key":"10.1016\/0020-0190(83)90056-X_BIB9_2","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1145\/363235.363259","article-title":"An axiomatic basis for computer programming","volume":"12","author":"Hoare","year":"1969","journal-title":"Comm. ACM"},{"issue":"3","key":"10.1016\/0020-0190(83)90056-X_BIB10","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321592.321606","article-title":"Formalization of properties of functional programs","volume":"17","author":"Manna","year":"1970","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/0020-0190(83)90056-X_BIB11","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1145\/359340.359353","article-title":"Is \u2018sometime\u2019 sometimes better than \u2018always\u2019?","volume":"21","author":"Manna","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(83)90056-X_BIB12","series-title":"Rept. FSC 72-6012","article-title":"Mathematical foundations of structured programming","author":"Mills","year":"1972"},{"key":"10.1016\/0020-0190(83)90056-X_BIB13","volume":"Vol. 1","author":"Mills","year":"1983"},{"key":"10.1016\/0020-0190(83)90056-X_BIB14","series-title":"CSL 74-3","article-title":"Introducing Prog into the pure Lisp prover","author":"Moore","year":"1974"},{"key":"10.1016\/0020-0190(83)90056-X_BIB15","article-title":"Program verification by subgoal induction","volume":"Vol. 2","author":"Morris","year":"1977"},{"key":"10.1016\/0020-0190(83)90056-X_BIB16","first-page":"109","article-title":"Semantical consideration on Floyd\u2013Hoare logic","author":"Pratt","year":"1976","journal-title":"Proc. 17th Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(83)90056-X_BIB17","first-page":"131","article-title":"Event-based reasoning\u2014A system for proving correct termination of programs","author":"Schwarz","year":"1976","journal-title":"Proc. 3rd Internat. Coll. on Automata, Languages and Programming"},{"key":"10.1016\/0020-0190(83)90056-X_BIB18","series-title":"Axiomatic Set Theory","author":"Suppes","year":"1972"},{"key":"10.1016\/0020-0190(83)90056-X_BIB19","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01940782","article-title":"An axiomatic basis for proving total correctness of Go-to programs","volume":"16","author":"Wang","year":"1976","journal-title":"BIT"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908390056X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908390056X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:52:55Z","timestamp":1555073575000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001908390056X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,10]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,10]]}},"alternative-id":["002001908390056X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(83)90056-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1983,10]]}}}