{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:49:39Z","timestamp":1725562179500},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212980"},{"type":"electronic","value":"9783540247272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24727-2_22","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T11:06:41Z","timestamp":1280747201000},"page":"304-317","source":"Crossref","is-referenced-by-count":6,"title":["Partial Correctness Assertions Provable in Dynamic Logics"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Leivant","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0304-3975(83)90107-X","volume":"22","author":"J.A. Bergstra","year":"1983","unstructured":"Bergstra, J.A., Tucker, J.V.: Hoare\u2019s Logic and Peano\u2019s Arithmetic. Theoretical Computer Science\u00a022, 265\u2013284 (1983)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"22_CR2","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1137\/0207005","volume":"7","author":"S.A. Cook","year":"1978","unstructured":"Cook, S.A.: Soundness and completeness of an axiom system for program verification. SIAM J. Computing\u00a07(1), 70\u201390 (1978)","journal-title":"SIAM J. Computing"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"704","DOI":"10.2307\/2273463","volume":"48","author":"P. Hajek","year":"1983","unstructured":"Hajek, P.: Arithmetical interpretations of Dynamic Logic. Jourmal of Symbolic Logic\u00a048, 704\u2013713 (1983)","journal-title":"Jourmal of Symbolic Logic"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0304-3975(86)90032-0","volume":"46","author":"P. Hajek","year":"1986","unstructured":"Hajek, P.: A simple dynamic logic. Theoretical Computer Science\u00a046, 239\u2013259 (1986)","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Harel, D.: First-order Dynamic Logic. In: LNCS, vol.\u00a068, Springer, Berlin (1979)","key":"22_CR5","DOI":"10.1007\/3-540-09237-4"},{"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","first-page":"95","volume-title":"Lectures on Modern Mathematics","author":"G. Kreisel","year":"1965","unstructured":"Kreisel, G.: Mathematical logic. In: Saaty, T. (ed.) Lectures on Modern Mathematics, vol.\u00a0III, pp. 95\u2013195. John Wiley, New York (1965)"},{"key":"22_CR8","first-page":"132","volume-title":"Conference Record of the Twelfth Annual Symposium on Principles of Programming Languages","author":"D. Leivant","year":"1985","unstructured":"Leivant, D.: Logical and mathematical reasoning about imperative programs. In: Conference Record of the Twelfth Annual Symposium on Principles of Programming Languages, pp. 132\u2013140. ACM, New York (1985)"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0304-3975(89)90156-4","volume":"66","author":"J.A. Makowsky","year":"1989","unstructured":"Makowsky, J.A., Sain, I.: Weak second order characterizations of various program verification systems. Theoretical Computer Science\u00a066, 299\u2013321 (1989)","journal-title":"Theoretical Computer Science"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"466","DOI":"10.2307\/2272731","volume":"37","author":"C. Parsons","year":"1972","unstructured":"Parsons, C.: On n-quantifier induction. The Journal of Symbolic Logic\u00a037, 466\u2013482 (1972)","journal-title":"The Journal of Symbolic Logic"},{"key":"22_CR11","volume-title":"Natural Deduction","author":"D. Prawitz","year":"1965","unstructured":"Prawitz, D.: Natural Deduction. Almqvist and Wiksell, Uppsala (1965)"},{"unstructured":"Segerberg, K.: A completeness theorem in the modal logic of programs (preliminary report). Notics of the American Mathematical Society\u00a024(6), A\u2013552 (1977)","key":"22_CR12"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24727-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T13:42:16Z","timestamp":1552830136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24727-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212980","9783540247272"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24727-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}