{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:17:26Z","timestamp":1742998646266,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642150241"},{"type":"electronic","value":"9783642150258"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15025-8_22","type":"book-chapter","created":{"date-parts":[[2010,8,16]],"date-time":"2010-08-16T02:52:44Z","timestamp":1281927164000},"page":"463-469","source":"Crossref","is-referenced-by-count":0,"title":["Halting and Equivalence of Program Schemes in Models of Arbitrary Theories"],"prefix":"10.1007","author":[{"given":"Dexter","family":"Kozen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"Angus, A., Kozen, D.: Kleene algebra with tests and program schematology. Tech. Rep. TR2001-1844, Computer Science Department, Cornell University (July 2001)"},{"key":"22_CR2","unstructured":"Barth, A., Kozen, D.: Equational verification of cache blocking in LU decomposition using Kleene algebra with tests. Tech. Rep. TR2002-1865, Computer Science Department, Cornell University (June 2002)"},{"key":"22_CR3","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0062837","volume-title":"The computational complexity of logical theories","author":"J. Ferrante","year":"1979","unstructured":"Ferrante, J., Rackoff, C.: The computational complexity of logical theories. Lecture Notes in Mathematics, vol.\u00a0718. Springer, Heidelberg (1979)"},{"key":"22_CR4","first-page":"261","volume-title":"Proc. 9th Symp. Theory of Comput.","author":"D. Harel","year":"1977","unstructured":"Harel, D., Meyer, A.R., Pratt, V.R.: Computability and completeness in logics of programs. In: Proc. 9th Symp. Theory of Comput., pp. 261\u2013268. ACM, New York (1977)"},{"issue":"1-2","key":"22_CR5","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/S0019-9958(84)80045-5","volume":"63","author":"D. Harel","year":"1984","unstructured":"Harel, D., Kozen, D.: A programming language for the inductive sets, and applications. Information and Control\u00a063(1-2), 118\u2013139 (1984)","journal-title":"Information and Control"},{"key":"22_CR6","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2516.001.0001","volume-title":"Dynamic Logic","author":"D. Harel","year":"2000","unstructured":"Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press, Cambridge (2000)"},{"key":"22_CR7","volume-title":"Mathematical Theory of Computation","author":"Z. Manna","year":"1974","unstructured":"Manna, Z.: Mathematical Theory of Computation. McGraw-Hill, New York (1974)"}],"container-title":["Lecture Notes in Computer Science","Fields of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15025-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:15:49Z","timestamp":1558286149000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15025-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642150241","9783642150258"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15025-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}