{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:53:52Z","timestamp":1725663232805},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540187400"},{"type":"electronic","value":"9783540481386"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18740-5_53","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:44:24Z","timestamp":1330199064000},"page":"251-258","source":"Crossref","is-referenced-by-count":0,"title":["Verification of programs with higher-order arrays"],"prefix":"10.1007","author":[{"given":"Wojciech","family":"Kowalczyk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Urzyczyn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"53_CR1","doi-asserted-by":"crossref","unstructured":"Apt, K., Ten years of Hoare Logic: a survey \u2014 Part I, ACM Trans. on Progr. Lang. and Systems, 3, 1981.","DOI":"10.1145\/357146.357150"},{"key":"53_CR2","doi-asserted-by":"crossref","unstructured":"Constable, R.L., Gries, D., On classes of program schemata, SIAM J. Comput., 1, 1972.","DOI":"10.1137\/0201006"},{"key":"53_CR3","doi-asserted-by":"crossref","unstructured":"Clarke, E.M., German, S.M., Halpern, J.Y., Effective axiomatizations of Hoare Logics, Journal ACM, 30, 1983.","DOI":"10.1145\/2402.322394"},{"key":"53_CR4","unstructured":"de Bakker, J., Mathematical theory of program correctness, Prentice-Hall, 1980."},{"key":"53_CR5","unstructured":"German, S.M., Clarke, E.M., Halpern, J.Y., True relative completeness of an axiom system for the language L-4, Proc. LICS'86."},{"key":"53_CR6","unstructured":"Kfoury, A.J., Urzyczyn, P., Finitely typed functional programs, Part II, to appear."},{"key":"53_CR7","unstructured":"Kfoury, A.J., Tiuryn, J., Urzyczyn, P., The hierarchy of simply typed functional programs, to appear Proc. LICS'87"},{"key":"53_CR8","unstructured":"Tiuryn, J., Higher-order arrays and stacks in programming. An application of complexity theory to logics of programs, Proc. MFCS'86."},{"key":"53_CR9","doi-asserted-by":"crossref","unstructured":"Tiuryn, J., Urzyczyn, P., Some relationships between logics of programs and complexity theory, Proc. FOCS'83.","DOI":"10.1109\/SFCS.1983.71"},{"key":"53_CR10","doi-asserted-by":"crossref","unstructured":"Urzyczyn, P., A necessary and sufficient condition in order that a Herbrand interpretation be expressive relative to recursive programs, Inf. Control, 56, 1983.","DOI":"10.1016\/S0019-9958(83)80006-0"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18740-5_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:15:23Z","timestamp":1605644123000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18740-5_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540187400","9783540481386"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-18740-5_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}