{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T12:17:49Z","timestamp":1792066669424,"version":"4.4.0"},"reference-count":5,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[1998,3]]},"abstract":"<jats:title>Abstract.<\/jats:title>\n          <jats:p>Time and space limitations can be specified, and proven, in exactly the same way as functionality. Proofs of time bounds, both implementation-independent and real-time, and of space requirements, both worst-case and average-case, are given in complete detail.<\/jats:p>","DOI":"10.1007\/s001650050017","type":"journal-article","created":{"date-parts":[[2002,8,25]],"date-time":"2002-08-25T07:30:30Z","timestamp":1030260630000},"page":"290-306","source":"Crossref","is-referenced-by-count":11,"title":["Formalization of Time and Space"],"prefix":"10.1145","volume":"10","author":[{"given":"Eric C. R.","family":"Hehner","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Toronto, Toronto, Canada, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","reference":[{"key":"p_1","volume-title":"Programming Concepts and Methods, edited by D. Gries and W.-P. deRoever","author":"Hayes I. J.","year":"1998"},{"key":"p_2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8596-5","volume-title":": A Practical Theory of Programming","author":"Hehner E. C. R.","year":"1993"},{"key":"p_3","volume-title":"A Classical Mind","author":"Hehner E. C. R.","year":"1994"},{"key":"p_4","volume-title":": Computational Complexity","author":"Papadimitriou C. H.","year":"1994"},{"key":"p_5","volume-title":"A Formal System for Specifying and Verifying Program Performance","author":"Shaw M.","year":"1979"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s001650050017.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s001650050017\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/s001650050017","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T15:26:34Z","timestamp":1641482794000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/s001650050017"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["10.1007\/s001650050017"],"URL":"https:\/\/doi.org\/10.1007\/s001650050017","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}