{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T11:51:38Z","timestamp":1648727498541},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"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":7777,"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":[[1992,4]]},"DOI":"10.1016\/0304-3975(92)90387-u","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"67-81","source":"Crossref","is-referenced-by-count":0,"title":["Semantics and reasoning with free procedures"],"prefix":"10.1016","volume":"97","author":[{"given":"Steven M.","family":"German","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90387-U_BIB1","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1145\/322108.322121","article-title":"Programming language constructs for which it is impossible to obtain good Hoare-like axioms","volume":"26","author":"Clarke","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(92)90387-U_BIB2","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/2402.322394","article-title":"Effective axiomatizations of Hoare logics","volume":"30","author":"Clarke","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(92)90387-U_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\/0304-3975(92)90387-U_BIB4","series-title":"A. Mathematical Introduction to Logic","author":"Enderton","year":"1972"},{"issue":"3","key":"10.1016\/0304-3975(92)90387-U_BIB5","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0890-5401(89)90040-0","article-title":"Reasoning about procedures as parameters in the language L4","volume":"83","author":"German","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(92)90387-U_BIB6","article-title":"On the power of the hypothesis of expressiveness","author":"German","year":"1983","journal-title":"IBM Research Report RJ 4079"},{"key":"10.1016\/0304-3975(92)90387-U_BIB7","series-title":"Proc. Conf. on Logics of Programs","first-page":"106","article-title":"calculus for functions defined by recursion on higher types","volume":"Vol. 193","author":"Goerdt","year":"1985"},{"key":"10.1016\/0304-3975(92)90387-U_BIB8","series-title":"Tech. Report 75","article-title":"A complete axiomatic system for proving assertions about recursive and nonrecursive programs","author":"Gorelick","year":"1975"},{"key":"10.1016\/0304-3975(92)90387-U_BIB9","article-title":"First-Order Dynamic Logic","volume":"Vol. 68","author":"Harel","year":"1979"},{"key":"10.1016\/0304-3975(92)90387-U_BIB10","first-page":"497","article-title":"Dynamic logic","volume":"10","author":"Harel","year":"1984"},{"key":"10.1016\/0304-3975(92)90387-U_BIB11","series-title":"Proc. Conf. on Logics of Programs","first-page":"320","article-title":"A partial correctness logic for procedures","volume":"Vol. 193","author":"Sieber","year":"1985"},{"key":"10.1016\/0304-3975(92)90387-U_BIB12","series-title":"Denotational Semantics: The Scott\u2014Strachey Approach to Programming Language Theory","author":"Stoy","year":"1977"},{"key":"10.1016\/0304-3975(92)90387-U_BIB13","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/S0019-9958(83)80006-0","article-title":"A necessary and sufficient condition in order that a Herbrand interpretation is expressive relative to recursive programs","volume":"56","author":"Urzyczyn","year":"1983","journal-title":"Inform. and Control"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290387U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290387U?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:57:24Z","timestamp":1555077444000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290387U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["030439759290387U"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90387-u","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}