{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:49:58Z","timestamp":1725662998886},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540095262"},{"type":"electronic","value":"9783540350880"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1979]]},"DOI":"10.1007\/3-540-09526-8_45","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:48:35Z","timestamp":1330188515000},"page":"453-462","source":"Crossref","is-referenced-by-count":1,"title":["On relaxation rules in algorithmic logic"],"prefix":"10.1007","author":[{"given":"B. A.","family":"Trakhtenbrot","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"C.A.R.Hoare, Procedures and parameters: An axiomatic approach, Lecture Notes in Mathematics, v. 188, Symposium on Semantics of Algorithmic Languages, 1971, 102\u2013116.","DOI":"10.1007\/BFb0059696"},{"key":"45_CR2","doi-asserted-by":"crossref","unstructured":"D.Harel, A.Pnueli, J.Stavi, A Complete Axiomatic System for Proving Deductions about Recursive Programs. Proceedings 9-th ACM Symp. Theory of Computing, 249\u2013260, 1977.","DOI":"10.1145\/800105.803415"},{"key":"45_CR3","unstructured":"J.Guttag, J.Horning, R.London, A Proof Rule for Euclid Procedures. Proceedings of the IFIP-Conference on Formal Description of Programming Concepts, North-Holland 1978, 211\u2013220."},{"key":"45_CR4","volume-title":"Completeness with finite systems of intermediate assertions for recursive schemes. Preprint IW 84\/77","author":"K. R. Apt","year":"1977","unstructured":"K.R. Apt, L.G.L.T. Meertens, Completeness with finite systems of intermediate assertions for recursive schemes. Preprint IW 84\/77. Stichting Mathematisch Centrum, Amsterdam, 1977."},{"key":"45_CR5","doi-asserted-by":"crossref","unstructured":"R.Cartwright, D.Oppen, Unrestricted Procedure Calls in Hoare's Logics, Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages, 1978, 131\u2013140.","DOI":"10.1145\/512760.512774"},{"key":"45_CR6","unstructured":"\u0411.\u0410.\u0422\u0440\u0430\u0445\u0442\u0435\u043d\u0431\u0440\u043e\u0442, \"\u041e \u043f\u043e\u043b\u043d\u043e\u0442\u0435 \u0430\u043b\u0433\u043e\u0440\u0438\u0442\u043c\u0438\u0447\u0435\u0441\u043a\u043e\u0439 \u043b\u043e\u0433\u0438\u043a\u0438\", \u041a\u0438\u0431\u0435\u0440\u043d\u0435\u0442\u0438\u043a\u0430, No 2, 1979."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1979"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-09526-8_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:00:58Z","timestamp":1619557258000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-09526-8_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"ISBN":["9783540095262","9783540350880"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-09526-8_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1979]]}}}