{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:52:45Z","timestamp":1725663165522},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540081388"},{"type":"electronic","value":"9783540373896"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1977]]},"DOI":"10.1007\/3-540-08138-0_17","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T11:17:43Z","timestamp":1330168663000},"page":"190-207","source":"Crossref","is-referenced-by-count":0,"title":["Formale Korrektheitsbeweise f\u00fcr While-Programme"],"prefix":"10.1007","author":[{"given":"J.","family":"Loeckx","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,23]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/BF00288746","volume":"4","author":"S. Igarashi","year":"1975","unstructured":"S. Igarashi, R.L. London, D.C. Luckham, \"Automatic program verification\", Acta Informatica 4, 2 (1975)","journal-title":"Acta Informatica"},{"key":"17_CR2","first-page":"1","volume":"7","author":"R. Milner","year":"1972","unstructured":"R. Milner, \"Implementation and applications of Scott's Logic for Computable Functions\", Proc. ACM Conf. on Proving Assertions about Programs, SIGPLAN Notices 7, 1 (1972)","journal-title":"Proc. ACM Conf. on Proving Assertions about Programs, SIGPLAN Notices"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/BF00289504","volume":"2","author":"C. A. R. R. Hoare","year":"1973","unstructured":"C.A.R. Hoare, N. Wirth, \"An axiomatic definition of the programming language PASCAL\", Acta Informatica 2, 4 (1973)","journal-title":"Acta Informatica"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"L. Aiello, M. Aiello, R. Weyrauch, \"The semantics of PASCAL in LCF\", Artif. Intell. Memo 221, Stanford Univ. (1974)","DOI":"10.21236\/AD0787631"},{"key":"17_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1137\/0205029","volume":"5","author":"E. A. Ashcroft","year":"1976","unstructured":"E.A. Ashcroft, W.W. Wadge, \"LUCID, a formal system for writing and proving programs\", SIAM J. Comp. 5, 3 (1976)","journal-title":"SIAM J. Comp."},{"key":"17_CR6","unstructured":"E.A. Ashcroft, W.W. Wadge, \"LUCID, a non-procedural language with iteration\", Comm. ACM, to appear"},{"key":"17_CR7","unstructured":"E.A. Ashcroft, W.W. Wadge, \"Program proving without tears\", Colloque de l'IRIA sur la construction, l'am\u00e9lioration et la v\u00e9rification de programmes, Arc-et-Senans, 1\u20133 juillet 1975"},{"key":"17_CR8","unstructured":"Z. Manna, \"Mathematical theory of computation\", McGraw-Hill, 1975"},{"key":"17_CR9","unstructured":"S. Lehmann, J. Loeckx, \"An algorithm normalizing elementary while-programs\", Bericht Nr. A 76\/14, Fachbereich 10, Universit\u00e4t des Saarlandes (Saarbr\u00fccken), Dezember 1976"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08138-0_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T16:51:17Z","timestamp":1619542277000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08138-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977]]},"ISBN":["9783540081388","9783540373896"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-08138-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1977]]}}}