{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T03:14:23Z","timestamp":1775790863636,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,10,1]],"date-time":"1987-10-01T00:00:00Z","timestamp":560044800000},"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":9421,"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,10]]},"DOI":"10.1016\/0167-6423(87)90029-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:19:32Z","timestamp":1027642772000},"page":"107-136","source":"Crossref","is-referenced-by-count":23,"title":["A hoare-like proof system for analysing the computation time of programs"],"prefix":"10.1016","volume":"9","author":[{"given":"Hanne Riis","family":"Nielson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(87)90029-3_BIB1","series-title":"A note on program verification","author":"Aczel","year":"1982"},{"key":"10.1016\/0167-6423(87)90029-3_BIB2","series-title":"Data Structures and Algorithms","author":"Aho","year":"1982"},{"key":"10.1016\/0167-6423(87)90029-3_BIB3","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1145\/357146.357150","article-title":"Ten years of Hoare's logic: a survey\u2014part I","volume":"3","author":"Apt","year":"1981","journal-title":"ACM Toplas"},{"key":"10.1016\/0167-6423(87)90029-3_BIB4","first-page":"451","article-title":"Complexity theory and the operational structure of algebraic programming systems","volume":"17","author":"Asfeld","year":"1982","journal-title":"Acta Informat."},{"key":"10.1016\/0167-6423(87)90029-3_BIB5","doi-asserted-by":"crossref","DOI":"10.1145\/319838.319847","article-title":"A simple applicative language: Mini-ML","author":"Clement","year":"1986","journal-title":"Proc. 1986 ACM Conference on Lisp and Functional Programming"},{"key":"10.1016\/0167-6423(87)90029-3_BIB6","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\/0167-6423(87)90029-3_BIB7","article-title":"First Order Dynamic Logic","volume":"68","author":"Harel","year":"1979"},{"key":"10.1016\/0167-6423(87)90029-3_BIB8","series-title":"Software Development: A Rigorous Approach","author":"Jones","year":"1980"},{"key":"10.1016\/0167-6423(87)90029-3_BIB9","series-title":"The Art of Computer Programming, Vol. 1: Fundamental Algorithms","author":"Knuth","year":"1973"},{"key":"10.1016\/0167-6423(87)90029-3_BIB10","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF00288637","article-title":"Axiomatic approach to total correctness of programs","volume":"3","author":"Manna","year":"1974","journal-title":"Acta Informat."},{"key":"10.1016\/0167-6423(87)90029-3_BIB11","doi-asserted-by":"crossref","DOI":"10.1145\/800225.806828","article-title":"Mechanical analysis of program complexity","author":"Le Metayer","year":"1985","journal-title":"Proc. ACM SIGPLAN 85 Symposium on Language Issues in Programming Environments"},{"key":"10.1016\/0167-6423(87)90029-3_BIB12","article-title":"Proof systems for computation time","author":"Nielson","year":"1983","journal-title":"Proc. 3rd Conference on Software Technology and Theoretical Computer Science"},{"key":"10.1016\/0167-6423(87)90029-3_BIB13","series-title":"Ph.D.-thesis","article-title":"Hoare logic's for run-time analysis of programs","author":"Nielson","year":"1984"},{"key":"10.1016\/0167-6423(87)90029-3_BIB14","series-title":"Report FN-19","article-title":"A structural approach to operational semantics","author":"Plotkin","year":"1981"},{"key":"10.1016\/0167-6423(87)90029-3_BIB15","series-title":"Mathematical Logic","author":"Shoenfield","year":"1967"},{"key":"10.1016\/0167-6423(87)90029-3_BIB16","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1145\/321978.321987","article-title":"Verifying program performance","volume":"23","author":"Wegbreit","year":"1976","journal-title":"J. ACM"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642387900293?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642387900293?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T08:29:01Z","timestamp":1555057741000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642387900293"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,10]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,10]]}},"alternative-id":["0167642387900293"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(87)90029-3","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1987,10]]}}}